On the security of the Lee-Chang group signature scheme and its derivatives

Marc Joye, Narn Yih Lee, Tzonelih Hwang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationInformation Security - 2nd International Workshop, ISW 1999, Proceedings
EditorsMasahiro Mambo, Yuliang Zheng
PublisherSpringer Verlag
Number of pages5
ISBN (Print)3540666958, 9783540666950
Publication statusPublished - 1999
Event2nd International Information Security Workshop, ISW 1999 - Kuala Lumpur, Malaysia
Duration: 1999 Nov 61999 Nov 7

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd International Information Security Workshop, ISW 1999
CityKuala Lumpur

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On the security of the Lee-Chang group signature scheme and its derivatives'. Together they form a unique fingerprint.

Cite this