Skip to main content

On the Security of the Lee-Chang Group Signature Scheme and Its Derivatives

  • Conference paper
  • First Online:
Information Security (ISW 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1729))

Included in the following conference series:

Abstract

W.-B. Lee and C.-C. Chang (1998) proposed a very efficient group signature scheme based on the discrete logarithm problem. This scheme was subsequently improved by Y.-M. Tseng and J.-K. Jan (1999) so that the resulting group signatures are unlinkable. In this paper, we show that any obvious attempt to make unlinkable the Lee-Chang signatures would likely fail. More importantly, we show that both the original Lee-Chang signature scheme and its improved version are universally forgeable.

The full paper is available as technical report (LCIS TR-99-7, May 1999) at URL <http://www.ee.tku.edu.tw/~lcis/techreports/1999/TR-99-7.html>.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David Chaum and Eugène van Heijst. Group signatures. In Advances in Cryptology — EUROCRYPT’91, LNCS 547, pp. 257–265. Springer-Verlag, 1991.

    Google Scholar 

  2. Wei-Bin Lee and Chin-Chen Chang. Efficient group signature scheme based on the discrete logarithm. IEE Proc. Comput. Digit. Tech., 145(1):15–18, 1998.

    Article  MathSciNet  Google Scholar 

  3. Anna Lysyanskaya and Zulfikar Ramzan. Group blind signatures: A scalable solution to electronic cash. In Financial Cryptography (FC’ 98), LNCS 1465, pp. 184–197. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  4. Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. In Advances in Cryptology — EUROCRYPT’94, LNCS 950, pp. 182–193. Springer-Verlag, 1995.

    Chapter  Google Scholar 

  5. Yuh-Min Tseng and Jinn-Ke Jan. Improved group signature scheme based on dis-crete logarithm problem. Electronics Letters, 35(1):37–38, 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joye, M., Lee, NY., Hwang, T. (1999). On the Security of the Lee-Chang Group Signature Scheme and Its Derivatives. In: Information Security. ISW 1999. Lecture Notes in Computer Science, vol 1729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47790-X_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-47790-X_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66695-0

  • Online ISBN: 978-3-540-47790-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics