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.
Author supplied keywords
Cite
CITATION STYLE
Joye, M., Lee, N. Y., & Hwang, T. (1999). On the security of the Lee-Chang group signature scheme and its derivatives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1729, pp. 47–51). Springer Verlag. https://doi.org/10.1007/3-540-47790-x_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
