Advertisement

On Zhang's nonrepudiable proxy signature schemes

  • Nam -Yih Lee
  • Tzonelih Hwang
  • Chih -Hung Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1438)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Mambo, K. Usuda, and E. Okamoto: “Proxy signatures for delegating signing operation,” Proc. 3rd ACM Conference on Computer and Communications Security, 1996.Google Scholar
  2. 2.
    K. Zhang: “Nonrepudiable proxy signature schemes based on discrete logarithm problem,” Manuscript, 1997.Google Scholar
  3. 3.
    K.Zhang: “Threshold proxy signature schemes,” 1997 Information Security Workshop, Japan, Sep., 1997, pp. 191–197.Google Scholar
  4. 4.
    S. M. Yen and C. S. Laih: “New digital signature scheme based on discrete logarithm,” Electronics Letters, 1993, 29, (12), pp. 1120–1121.Google Scholar
  5. 5.
    L. Harn: “New digital signature scheme based on discrete logarithm,” Electronics Letters, 1994, 30, (5), pp. 396–398.CrossRefGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    T. ElGamal: “A public key cryptosystem and signature scheme based on discrete logarithms,” IEEE Tran., 1985, IT-31, (4), pp. 469–472.MathSciNetGoogle Scholar
  8. 8.
    C.P. Schnorr: “Efficient identification and signatures for smart cards,” Advances in Cryptology Crypto'89, 1989, pp. 239–252.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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.CrossRefGoogle Scholar
  11. 11.
    R. Rivest, “The MD5 message digest algorithm,” RFC 1321, Apr 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Nam -Yih Lee
    • 1
  • Tzonelih Hwang
    • 2
  • Chih -Hung Wang
    • 2
  1. 1.Department of Applied Foreign LanguageNan-Tai Institute of TechnologyTainanTaiwan, Republic of China
  2. 2.Institute of Information EngineeringNational Cheng-Kung UniversityTainanTaiwan, Republic of China

Personalised recommendations