Abstract
Digital signatures are important applications of public key cryptography in today’s digital networks. However, they have a problem that anyone can verify the signature even if a signer wants to restrict the verifiers to confirm his signatures. D. Chaum et al.[1] proposed undeniable signatures to solve this problem. These signatures are based on the discrete logarithm problem and are extended to those with different properties [2]-[4]. After that, R.Gennaro et al.[5] proposed another undeniable signature scheme based on RSA. However, this scheme also has following problems. Firstly, the undeniable signature of them cannot be converted into a usual signature individually. So if a user wants to use both of the undeniable signature and the usual signature, he must prepare separate parameters for each type of signatures. Secondly, the denial protocol is not deterministic because it uses a zero knowledge interactive proof. So it is not efficient. Thirdly, their signature system cannot resist hidden verifier attack[7]. In this paper we will propose an improved scheme to solve these problems.
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
D. Chaum and H. V. Antwerpen,“Undeniable Signatures”, Proc. CRYPTO’89 pp.212–217, 1990.
D. Chaum,“Zero-Knowledge Undeniable Signatures”, Proc. EUROCRYPTO’90 pp.458–464, 1990.
J. Boyar, D. Chaum, I. Damgård and T. Pedersen, “Convertible Undeniable Signatures”, Proc. CRYPTO’90 pp.189–205, 1991.
D. Chaum, “Designated Confirmer Signatures”, Proc. EUROCRYPTO’94 pp.86–91, 1994.
R. Gennaro, H. Krawczyk and T. Rabin, “RSA-Based Undeniable Signatures”, Proc. CRYPTO’97 pp.132–149, 1997. http://www.research.ibm.com/security/RSAunden.ps
Y. Desmedt and M. Yung, “Weaknesses of Undeniable Signature Schemes”, Advances in Cryptology Proceedings of EUROCRYPTO’91
M. Jakobsson, K. Sako and R. Impagliazzo, “Designated Verifier Proofs and Their Applications”, Advances in Cryptology-EUROCRYPT’96, Lecture Notes in Computer Science 1070, Springer-Verlag, pp.143–154, 1996.
R. Housley, SPYRUS, W. Ford, VeriSign, W. Polk, NIST, D. Solo, and Citicorp “Internet X.509 Public Key Infrastructure Certificate and CRL Profile”, RFC2459, 1999.
R. Gennaro, D. Micciancio and T. Rabin, ”An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products”,Proc. of the Fifth ACM Conference on Computer and Communications Security, 1998. http://www.research.ibm.com/security/safeprime.ps
D.R. Stinson, CRYPTOGRAPHY, pp.218–225, CRC Press, 1996.
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
Miyazaki, T. (2001). An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive