两个群签名方案的安全性分析  

Security Analysis of Two Group Signature Schemes

作　　者：汪精明[1] 王平水[1] 

机构地区：[1]安徽财经大学网络中心,安徽蚌埠233041

出　　处：《计算机技术与发展》2007年第9期149-152,共4页Computer Technology and Development

基　　金：安徽省教育厅自然科学基金资助项目(2006KJ017C)

摘　　要：群签名在电子现金、电子选举等领域有着广泛应用,因此基于不同的数学问题设计安全高效的群签名方案有着重要意义。对最近提出的一个基于中国剩余定理的群签名方案和一个基于RSA签名的群签名方案进行研究,发现这两个方案存在安全漏洞:第一个方案中,任何一个群成员均可以分解系统模数,从而可以计算出系统中所有人的私钥;第二个方案的群签名打开算法不正确,从而无法追踪到群签名的生成者。分析表明,这两个方案均是不安全的,需要进一步完善。Group signature schemes have many applications, such as electronic cash and electronic vote. Thus, it is significant to devise efficient and secure group signature schemes based on all kinds of mathematic problems. In this paper, a group signature scheme based on Chinese remainder theorem and a group signature scheme based on RSA signature scheme are studied. Two security flaws in these schemes are found：in the former,the modulus of the system can be decomposed by every member of the group,so the private keys of everyone in the group can be computed; in the latter, the opening algorithm of the group signature scheme is incorrect, so the signer of the group signature can not be traced correctly. The analysis shows that the two schemes are not secure and need to be implemented.

关 键 词：群签名 中国剩余定理 可追踪性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]