摘要
1998年Lee 和Chang 提出了一种基于离散对数问题的非交互的群签名方案。Tseng-Jan；李、张、刘、杨；敖、陈、白分别给出了改进方案。该文指出Lee-Chang方案及所有派生类方案都不具备防伪造性。它们都可以用类似的伪造签名方法，产生一个不可跟踪的群签名。
In 1998,Lee and Chang proposed a group signature scheme based on the discrete logarithm problem. Lately Seng-Jan; Li, Zhang, Liu, Yong; and Ao, Chen, Bai give respectively new improved schemes based on Lee-Chang scheme. This paper shows that these schemes derived from Lee-Chang are not secure and untraceable group signatures are given by similar forery attacks.
出处
《计算机工程》
CAS
CSCD
北大核心
2003年第20期108-110,共3页
Computer Engineering
基金
上海市高等学校科技发展基金资助项目(OZJE 14031)
