一种基于中国剩余定理的群签名方案及其改进  

A Group Signature Scheme Based on Chinese Remainder Theorem and Its Improvement

作　　者：杨书思[1] 程晓峰[1] 

机构地区：[1]广州大学数学与信息科学学院,广东广州510006

出　　处：《信息安全与通信保密》2008年第12期140-142,共3页Information Security and Communications Privacy

摘　　要：陈泽文等人提出了一种基于中国剩余定理的群签名方案。文中认为,该方案可以在不改变其他有效成员签名密钥的情况下,增加或者撤销一个群成员,并且在撤销过程中不改变公钥的长度,可以抗击联合攻击、伪造签名等。但是研究发现,该方案在公共模上的疏忽,使其无法面对伪造签名攻击,并且存在在合谋情况下,实现将大整数n分解的概率算法,论文对其做出了改进。Chen Ze wen and others have put forword a group signature scheme based on Chinese Remainder Theorem. This scheme can add or delete an member of the group without changing other effective members, keys and the length of the public key.The security of this scheme can resist collusion attack and forged signature and so on. However, the study indicates that this scheme due to its negligence of common modulus, cannot resist the forged signature attack, and it also can actualize the probability algorithm of factorizing the big integer under the conllusion condition. This paper makes has described some improvement in this aspect.

关 键 词：中国剩余定理 群签名 成员撤销 同一大整数 

分 类 号：TN918[电子电信—通信与信息系统]