Abstract
A feasible solution to prevent potential misuse of signatures is to put some restrictions on their verification. Therefore S.J.Kim, [4] S.J.Park and D.H.Won introduced the nominative signature, in which only the nominee can verify and prove the validity of given signatures, and proposed a nominative signature scheme (called KPW scheme). In this paper, we first show that KPW scheme is not nominative because the nominator can also verify and prove the validity of given signatures. Then we extend the concept of nominative signature to the convertible nominative signature which has an additional property that the nominee can convert given nominative signatures into universally verifiable signatures. We give a formal definition for it and propose a practical scheme that implements it. The proposed scheme is secure, in which its unforgeability is the same as that of the Schnorr’s signature scheme and its untransferability relies on the hardness of the Decision-Diffie-Hellman Problem.
This work is supported by the National Natural Science Foundation of China under Grant No.19931010 and the National Grand Fundamental Research 973 Program of China under Grant No. G1999035803.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chaum, D., Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)
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–205. Springer, Heidelberg (1991)
Lim, C.H., Lee, P.J.: Modified Maurer-Yacobi’s Scheme and its Applications. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 308–323. Springer, Heidelberg (1993)
Chaum, D.: Designated Confirmer Signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 86–91. Springer, Heidelberg (1995)
Kim, S.J., Park, S.J., Won, D.H.: Zero-knowledge Nominative Signatures. In: Proc. of PragoCrypt 1996, International Conference on the Theory and Applications of Cryptology, pp. 380–392 (1996)
Park, H.U., Lee, I.Y.: A Digital Nominative Proxy Signature Scheme for Mobile Communication. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 451–455. Springer, Heidelberg (2001)
Michels, M., Stadler, M.: Efficient Convertible Undeniable Signature Schemes. In: Proc. of 4th annual workshop on selected areas in cryptography, SAC 1997, pp. 231–244 (1997)
Camenisch, J.: Efficient and Generalized Group Signatures. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 465–479. Springer, Heidelberg (1997)
Schnorr, C.P.: Efficient Signature Generation for Smart Cards. Journal of Cryptology (4), 239–252 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, Z., Wang, Y. (2004). Convertible Nominative Signatures. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds) Information Security and Privacy. ACISP 2004. Lecture Notes in Computer Science, vol 3108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27800-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-27800-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22379-5
Online ISBN: 978-3-540-27800-9
eBook Packages: Springer Book Archive