Abstract
In 1997, Zhang proposed two new nonrepudiable proxy signature schemes to delegate signing capability. Both schemes claimed to have a property of knowing that a proxy signature is generated by either the original signer or a proxy signer. However, this paper will show that Zhang's second scheme fails to possess this property. Moreover, we shall show that the proxy signer can cheat to get the original signer's signature, if Zhang's scheme is based on some variants of ElGamal-type signature schemes. We modify Zhang's nonrepudiable proxy signature scheme to avoid the above attacks. The modified scheme also investigates a new feature for the original signer to limit the delegation time to a certain period.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Mambo, K. Usuda, and E. Okamoto: “Proxy signatures for delegating signing operation,” Proc. 3rd ACM Conference on Computer and Communications Security, 1996.
K. Zhang: “Nonrepudiable proxy signature schemes based on discrete logarithm problem,” Manuscript, 1997.
K.Zhang: “Threshold proxy signature schemes,” 1997 Information Security Workshop, Japan, Sep., 1997, pp. 191–197.
S. M. Yen and C. S. Laih: “New digital signature scheme based on discrete logarithm,” Electronics Letters, 1993, 29, (12), pp. 1120–1121.
L. Harn: “New digital signature scheme based on discrete logarithm,” Electronics Letters, 1994, 30, (5), pp. 396–398.
J. L. Camenisch, J-M. Piveteau, and M.A. Stadler: “Blind signatures based on the discrete logarithm problem,” Proc. EvroCrypt'94, 1994, pp. 428–432.
T. ElGamal: “A public key cryptosystem and signature scheme based on discrete logarithms,” IEEE Tran., 1985, IT-31, (4), pp. 469–472.
C.P. Schnorr: “Efficient identification and signatures for smart cards,” Advances in Cryptology Crypto'89, 1989, pp. 239–252.
K. Nyberg and R.A. Rueppel: “A new signature scheme based on the DSA giving message recovery,” Proc. 1st ACM conference on Computer and Communications Security, Number 3–5, Fairfax, Virginia, 1993.
L. Harn and Y. Xu: “Design of generalized ElGamal type digital signature schemes based on discrete logarithm,” Electronics Letters, Vol. 30, (24), 1994, pp. 2025–2026.
R. Rivest, “The MD5 message digest algorithm,” RFC 1321, Apr 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, N.Y., Hwang, T., Wang, C.H. (1998). On Zhang's nonrepudiable proxy signature schemes. In: Boyd, C., Dawson, E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053752
Download citation
DOI: https://doi.org/10.1007/BFb0053752
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64732-4
Online ISBN: 978-3-540-69101-3
eBook Packages: Springer Book Archive