Skip to main content
SpringerLink
Log in
Book cover

International Conference on Provable Security

ProvSec 2010: Provable Security pp 70–86Cite as

A Framework for Constructing Convertible Undeniable Signatures

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6402))

Abstract

In this paper, we propose a framework for constructing convertible undeniable signatures from weakly-secure standard signatures. We then present a concrete instantiation employing a standard signature scheme recently proposed at Eurocrypt ’09. The instantiation is the first (convertible) undeniable signature scheme whose unforgeability relies on the well-known RSA assumption.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ateniese, G., Medeiros, B.: Identity-based chameleon hash and applications. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 164–180. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 431–444. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Boyd, C., Foo, E.: Off-line fair payment protocols using convertible signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 271–285. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Boyar, J., Chaum, D., Damgard, I., Pedersen, T.: Convertible undeniable signatures. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 189–208. Springer, Heidelberg (1991)

    Google Scholar 

  5. Chaum, D.: Zero-knowledge undeniable signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 458–464. Springer, Heidelberg (1995)

    Google Scholar 

  6. Chaum, D., van Heijst, E., Pfitzmann, B.: Crypto-graphically strong undeniable signatures, unconditionally secure for the signer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 470–484. Springer, Heidelberg (1992)

    Google Scholar 

  7. Chaum, D., Antwerpen, H.V.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)

    Google Scholar 

  8. Chaum, T., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  9. Damgård, I., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125–142. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Damgård, I., Pedersen, T.: New convertible undeniable signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 372–386. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  11. El Aimani, L.: Toward a generic construction of universally convertible undeniable signatures from pairing-based signatures. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 145–157. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. El Aimani, L.: On Generic Constructions of Designated Confirmer Signatures. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 343–362. Springer, Heidelberg (2009), http://eprint.iacr.org/2009/403

    Chapter  Google Scholar 

  13. El Aimani, L.: Efficient Confirmer Signatures from the Signature of a Commitment Paradigm, Cryptology ePrint Archive, Report 2009/435 (2009), http://eprint.iacr.org/ , (accepted to ProvSec 2010)

  14. El Aimani, L.: Anonymity from Public Key Encryption to Undeniable Signatures. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 217–234. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16–30. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  16. Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. IEICE Trans. Fundamental E82-A(1), 81–92 (1999)

    MATH  Google Scholar 

  17. Galbraith, S.D., Mao, W.: Invisibility and Anonymity of Undeniable and Confirmer Signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 80–97. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Gennaro, R., Krawczyk, H., Rabin, T.: RSA based undeniable signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 132–149. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. Journal of Cryptology 7(1), 1–32 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hohenberger, S., Waters, B.: Realizing hash-and-sign signatures under standard assumptions. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 333–350. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  21. Hohenberger, S., Waters, B.: Short and Stateless Signatures from the RSA Assumption. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol. 5677, pp. 654–670. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  22. Huang, Q., Wong, D.S.: New constructions of convertible undeniable signature schemes without random oracles. Cryptology ePrint Archive, Report 2009/517 (2009), http://eprint.iacr.org/

  23. Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143–154. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  24. Kurosawa, K., Heng, S.H.: Relations among security notions for undeniable signature schemes. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 34–48. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Krawczyk, H., Rabin, T.: Chameleon signatures. In: Proc. of Network and Distributed System Security Symposium 2000, pp. 143–154 (2000)

    Google Scholar 

  26. Kurosawa, K., Takagi, T.: New approach for selectively convertible undeniable signature schemes. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 428–443. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  27. Michels, M., Petersen, H., Horster, P.: Breaking and Repairing a Convertible Undeniable Signature Scheme. In: ACM CCS 1996, pp. 148–152 (1996)

    Google Scholar 

  28. Ogata, W., Kurosawa, K., Heng, S.-H.: The security of the FDH variant of Chaum’s undeniable signature scheme. IEEE Transactions on Information Theory 52(5), 2006–2017 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  29. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  30. Pointcheval, D.: Self-scrambling anonymizers. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 259–275. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  31. Phong, L.T., Kurosawa, K., Ogata, W.: New dlog-based convertible undeniable signature schemes in the standard model, Cryptology ePrint Archive, Report 2009/394 (2009), http://eprint.iacr.org/

  32. Phong, L.T., Kurosawa, K., Ogata, W.: New RSA-based (selectively) Convertible Undeniable Signature Schemes. IEICE Trans. Fundamental E93-A(1), 63–75 (2010)

    Article  MATH  Google Scholar 

  33. Jacob, C., Schuldt, N., Matsuura, K.: An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification, Cryptology ePrint Archive, Report 2009/454 (2009), http://eprint.iacr.org/ (to appear in ISPEC 2010)

  34. Yuen, T.H., Au, M.H., Liu, J.K., Susilo, W. (Convertible) undeniable signatures without random oracles. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 83–97. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  35. Wu, W., Mu, Y., Susilo, W., Huang, X.: Convertible Undeniable Proxy Signatures: Security Models and Efficient Construction. In: Kim, S., Yung, M., Lee, H.-W. (eds.) WISA 2007. LNCS, vol. 4867, pp. 16–29. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT, Japan

    Ryo Kikuchi

  2. NICT, Japan

    Le Trieu Phong

  3. Tokyo Institute of Technology, Japan

    Wakaha Ogata

Authors
  1. Ryo Kikuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Le Trieu Phong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wakaha Ogata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Information Science and Technology, Jalan Ayer Keroh Lama, Multimedia University, 75450, Malacca, Malaysia

    Swee-Huay Heng

  2. Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, 316-8511, Hitachi, Ibaraki, Japan

    Kaoru Kurosawa

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kikuchi, R., Phong, L.T., Ogata, W. (2010). A Framework for Constructing Convertible Undeniable Signatures. In: Heng, SH., Kurosawa, K. (eds) Provable Security. ProvSec 2010. Lecture Notes in Computer Science, vol 6402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16280-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16280-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16279-4

  • Online ISBN: 978-3-642-16280-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation