Published in

Springer, Lecture Notes in Computer Science, p. 47-51, 1999

DOI: 10.1007/3-540-47790-x_5

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 1998 by Marc Joye, Masahiro Mambo, Yuliang Zheng, Narn-Yih Lee, Tzonelih Hwang
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

W.-B. Lee and C.-C. Chang [Efficient group signature scheme based on discrete logarithm, IEE Proc. Comput. Digit. Tech. 145, No. 1, 15-18 (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 [Improved group signature scheme based on discrete logarithm problem, Electron. Lett. 35, No. 1, 37-38 (1999)] so that the resulting group signatures are unlinkable. In this paper, the authors show that any obvious attempt to make unlinkable the Lee-Chang signatures would likely fail. More importantly, they show that both the original Lee-Chang signature scheme and its improved version are universally forgeable.