Group Blind Digital Signatures: A Scalable Solution to Electronic Cash
FC '98 Proceedings of the Second International Conference on Financial Cryptography
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Hi-index | 0.00 |
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.