Abstract
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete logarithm problem is hard to solve. Two schemes (the ID-type and the random-type schemes) based on the linear scheme for the Key Predistribution Systems (KPS) and the discrete logarithm problem (DLP) were given. In this paper we show that those two schemes fail to meet the nonrepudiation requirement: with negligible amount of computation, a signature could be forged. For the ID-type signature scheme, any verifier could forge a signature to raise repudiation between that verifier and the signer. The random type signature scheme has the same weakness. Furthermore, for the random-type signature scheme, once a signer issued a signature, anyone (not only the user in the scheme) could forge that signer's signature for a n arbitrary message.
Chapter PDF
Similar content being viewed by others
References
R. Blom, “Non-public Key Distribution”, in Advances in Cryptology-Crypto’82, Plenum Press (1983), pp. 231–236.
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, “Perfectly Secure Key Distribution for Dynamic Conferences”, in Advances in Cryptology-Crypto’92, LNCS 740, Springer-Verlag, pp.471–486, 1993.
Y. Desmedt and J. J. Quisquater, “Public-Key Systems Based on the Dificulty of Tampering (Is There a Difference Between DES and RSA?)”, in Advances in Cryptology Crypto’86, LNCS 263, Springer-Verlag, pp. 111–117, 1986.
Y. Desmedt and V. Viswanathan, “Unconditionally Secure Dynamic Conference Key Distribution”, IEEE, ISIT’98, 1998.
T. ElGamal. “A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms”. IEEE Transactions on Information Theory, 31 (1985), 469–472.
A. Fiat and M. Naor, “Broadcast Encryption”, in Advances in Cryptology-Crypto’93, LNCS 773, Springer-Verlag, pp. 480–491, 1994.
L. Gong and D. J. Wheeler, “A Matrix Key-Distribution Scheme”, Journal of Cryptology, vol. 2, pp. 51–59, Springer-Verlag (1993).
W. A. Jackson, K. M. Martin, and C. M. O'keefe, “Multisecret Threshold Schemes”, in Advances in Cryptology-Crypto’93, LNCS 773, Springer-Verlag, pp. 126–135, 1994.
T. Matsumoto and H. Imai, “On the Key Predistribution System: A Practical Solution to the Key Distribution Problem”, in Advances in Cryptology-Crypto’87, LNCS 293, Springer-Verlag, pp.185–193, 1987.
T. Matsumoto and H. Imai, “Applying the Key Predistribution Systems to Electronic Mails and Signatures”, in Proc. of SITA’87, pp. 101–106, 1987.
V. Miller, “Uses of Elliptic Curves in Cryptography”, in Advances in Cryptology-Crypto’85, LNCS 218, Springer-Verlag, pp. 417–426, 1986.
T. Nishioka, G. Hanaoka, and H. Imai, “A New Digital Signature Scheme on ID-Based Key-sharing Infrastructures”, in Information Security-Proc. of ISW’99, LNCS 1729, Springer-Verlag, pp. 259–270, 1999.
R. L. Rivest, A, Shamir, and L. Adleman, “A method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Commun. ACM, vol. 21, no. 2, pp. 158–164, Feb. 1978.
A. Shamir, “Identity-Based Cryptosystems and Signature Schemes”, in Advances in Cryptology-Crypto’84, LNCS 196, Springer-Verlag, pp. 47–53, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, H., Bao, F., Deng, R.H. (2001). Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive