Skip to main content
Springer Nature Link
Log in

A Generic Construction for Universally-Convertible Undeniable Signatures

  • Conference paper
Cryptology and Network Security (CANS 2007)

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

Included in the following conference series:

Abstract

Undeniable signatures are classic digital signatures which are not universally verifiable and can only be verified with the help of the signer. Its extended version, convertible undeniable signatures, equips the signer with the additional ability to make his undeniable signatures universally verifiable whenever required. A selectively-convertible undeniable signature scheme allows the signer to convert a single signature into a universally verifiable signature by releasing a selective proof in a later time, while “universally-convertible” refers to the case where the signer has the additional ability to generate a universal proof which can finally convert all his undeniable signatures into universally verifiable signatures. In this paper, we propose a generic construction for universally-convertible undeniable signatures. Our construction is based on three building blocks: a strongly unforgeable classic signature scheme, a selectively-convertible undeniable signature scheme and a collision-resistant hash function. Formal proofs guarantee that our construction has a tight security reduction to the underlying security assumptions. As one of the applications of our generic construction, one can obtain the first provable secure universally-convertible undeniable signature scheme in the standard model.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boneh, D., Boyen, X.: Short Signatures without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 382–400. Springer, Heidelberg (2004)

    Google Scholar 

  2. Boneh, D., Shen, E., Waters, B.: Strongly Unforgeable Signatures based on Computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 229–240. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Biehl, I., Paulus, S., Takagi, T.: Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. In: Designs, Codes and Cryptography, vol. 31(2), pp. 99–123. Springer, Netherlands (2004)

    Google Scholar 

  4. Boyar, J., Chaum, D., Damgård, I.B., Pedersen, T.P.: Convertible Undeniable Signatures. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 189–205. Springer, Heidelberg (1991)

    Google Scholar 

  5. Chaum, D.: Designated Confirmer Signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 86–91. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

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

    Google Scholar 

  7. Chaum, D.: Zero-Knowledge Undeniable Signatures (Extended Abstract). In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 458–464. Springer, Heidelberg (1991)

    Google Scholar 

  8. Diffie, W., Hellman, M.: New directions in cryptography. IEEE IT 22, 644–654 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  9. Damgård, I.B., Pedersen, T.P.: New Convertible Undeniable Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 372–386. Springer, Heidelberg (1996)

    Google Scholar 

  10. Desmedt, Y., Yung, M.: Weaknesses of Undeniable Signature Schemes (Extended Abstract). In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 205–220. Springer, Heidelberg (1991)

    Google Scholar 

  11. Fujioka, A., Okamotoa, T., Ohta, K.: Interactive Bi-Proof Systems and Undeniable Signature Schemes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 243–256. Springer, Heidelberg (1991)

    Google Scholar 

  12. Goldreich, O.: Foundations of Cryptography, Basic Applications, vol. II. Cambridge University Press, Cambridge (2004)

    Google Scholar 

  13. Goldwasser, S., Micali, S., Rivest, R.: A Digital signature scheme secure against adaptively chosen message attacks. SIAM Journal on Computing 17(2), 281–308 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  14. Galbraith, S.D., Mao, W., Paterson, K.G.: RSA-Based Undeniable Signatures for General Moduli. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 200–217. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. 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 

  16. 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)

    Google Scholar 

  17. Gennaro, R., Rabin, T., Krawczyk, H.: RSA-Based Undeniable Signatures. Journal of Cryptology 13(4), 397–416 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Huang, X., Mu, Y., Susilo, W., Wu, W.: Provably Secure Pairing-based Convertible Undeniable Signature with Short Signature Length. In: Pairing 2007. LNCS, vol. 4575, pp. 367–391. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. 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)

    Google Scholar 

  20. Jongkook, L., Shiryong, R., Jeungseop, K., Keeyoung, Y.: A New Undeniable Signature Scheme Using Smart Cards. In: Honary, B. (ed.) Cryptography and Coding. LNCS, vol. 2260, pp. 387–394. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Jakobsson, M.: Blackmailing Using Undeniable Signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 425–427. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  22. Furukawa, J., Kurosawa, K., Imai, H.: An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 46–57. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Kudla, C., Paterson, K.G.: Non-interactive Designated Verifier Proofs and Undeniable Signatures. In: Smart, N.P. (ed.) Cryptography and Coding. LNCS, vol. 3796, pp. 136–154. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Kim, S., Won, D.: Threshold Entrusted Undeniable Signature. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 195–203. Springer, Heidelberg (2005)

    Google Scholar 

  25. Kurosawa, K., Heng, S-H.: 3-Move Undeniable Signature Scheme. In: Fuhr, N., Lalmas, M., Malik, S., Szlávik, Z. (eds.) INEX 2004. LNCS, vol. 3493, pp. 181–197. Springer, Heidelberg (2005)

    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. Huang, Q., Wong, D.S., Zhao, Y.: Generic Transformation to Strongly Unforgeable Signatures. ACNS 2007, Available online http://eprint.iacr.org/2006/346

  28. Laguillaumie, F., Paillier, P., Vergnaud, D.: Universally Convertible Directed Signatures. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 682–701. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  29. Libert, B., Quisquater, J.-J.: Identity Based Undeniable Signatures. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 112–125. Springer, Heidelberg (2004)

    Google Scholar 

  30. Lyuu, Y.-D., Wu, M.-L.: Convertible Group Undeniable Signatures. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 48–61. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  31. Laguillaumie, F., Vergnaud, D.: Time-Selective Convertible Undeniable Signatures. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 154–171. Springer, Heidelberg (2005)

    Google Scholar 

  32. Laguillaumie, F., Vergnaud, D.: Short Undeniable Signatures Without Random Oracles: The Missing Link. In: Maitra, S., Madhavan, C.E.V., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 283–296. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  33. Miyazaki, T.: An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 135–149. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  34. Michels, M., Petersen, H., Horster, P.: Breaking and Repairing a Convertible Undeniable Signature Scheme. In: Third ACM Conference on Computer and Communications Security, pp. 148–152. ACM Press, New York (1996)

    Google Scholar 

  35. Michels, M., Stadler, M.: Efficient Convertible Undeniable Signature Schemes. In: SAC 1997. The 4th International Workshop on Selected Areas in Cryptography, pp. 231–244 (1997)

    Google Scholar 

  36. Monnerat, J., Vaudenay, S.: Undeniable Signatures Based on Characters: How to Sign with One Bit. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 69–85. Springer, Heidelberg (2004)

    Google Scholar 

  37. Monnerat, J., Vaudenay, S.: Generic Homomorphic Undeniable Signatures. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 354–371. Springer, Heidelberg (2004)

    Google Scholar 

  38. Monnerat, J., Vaudenay, S.: Optimization of the MOVA Undeniable Signature Scheme. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 196–209. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  39. Monnerat, J., Vaudenay, S.: Short 2-Move Undeniable Signatures. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 19–36. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  40. National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186-2 (January 2000)

    Google Scholar 

  41. Ogata, W., Kurosawa, K., Heng, S.-H.: The Security of the FDH Variant of Chaum’s Undeniable Signature Scheme. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 328–345. Springer, Heidelberg (2005)

    Google Scholar 

  42. Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 104–118. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  44. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)

    Article  MATH  Google Scholar 

  45. Steinfeld, R., Pieprzyk, J., Wang, H.: How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 357–371. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  46. Teranishi, I., Oyama, T., Ogata, W.: General Conversion for Obtaining Strongly Existentially Unforgeable Signatures. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 191–205. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  47. Wang, G.: An Attack on Not-interactive Designated Verifier Proofs for Undeniable Signatures, Available online http://eprint.iacr.org/2003/243

  48. Wang, G., Qing, S., Wang, M., Zhou, Z.: Threshold Undeniable RSA Signature Scheme. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 221–232. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  49. Wang, G., Zhou, J., Deng, R.H.: On the Security of the Lee-Hwang Group-Oriented Undeniable Signature schemes. In: Katsikas, S.K., Lopez, J., Pernul, G. (eds.) TrustBus 2004. LNCS, vol. 3184, pp. 289–298. Springer, Heidelberg (2004), Avaliable online http://eprint.iacr.org/2002/150

    Google Scholar 

  50. Zhang, F., Safavi-Naini, R., Susilo, W.: Attack on Han et al.’s ID-based Confirmer (Undeniable) Signature at ACM-EC 2003, Avalibale online http://eprint.iacr.org/2003/129

  51. Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Application. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Computer and Information Security Research, School of Computer Science & Software Engineering, University of Wollongong, Australia

    Xinyi Huang, Yi Mu, Willy Susilo & Wei Wu

Authors
  1. Xinyi Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Willy Susilo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Feng Bao San Ling Tatsuaki Okamoto Huaxiong Wang Chaoping Xing

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, X., Mu, Y., Susilo, W., Wu, W. (2007). A Generic Construction for Universally-Convertible Undeniable Signatures. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds) Cryptology and Network Security. CANS 2007. Lecture Notes in Computer Science, vol 4856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76969-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76969-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76968-2

  • Online ISBN: 978-3-540-76969-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics