使用中国剩余定理的群签名方案  

Group Signature Scheme Using Chinese Remainder Theorem

作　　者：党佳莉 俞惠芳[1] 

机构地区：[1]青海师范大学计算机学院,西宁810008

出　　处：《计算机工程》2015年第2期113-116,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(61363080);教育部春晖计划基金资助项目(Z2012094)

摘　　要：现有群签名方案存在不能抵抗陷害攻击和伪造攻击的问题。为此,将中国剩余定理用于群签名中,提出一种新的群签名方案。利用中国剩余定理的数学特性,只需简单计算就能将一些重要的秘密信息进行整合,可以更好地保证成员私钥和身份的隐密性,同时,能够较好地控制计算过程中数据的长度,从而简化计算过程,在不改变其他合法群成员密钥的情况下,实现群成员的加入和撤销。分析结果表明,该方案具有匿名性、防伪造性、可跟踪性、防联合攻击和防重放攻击等优点。Some existing group signatures can not resist the defects of exculpability and unforgeability.In order to solve this problem,this paper applies the Chinese remainder theorem to group signature,and proposes a secure group signature scheme using Chinese remainder theorem.Using the mathematical properties of Chinese remainder theorem,only simple calculation to some important secret information integration can better ensure the privacy of the private key and identity.At the same time,this scheme can effectively control the length of the data in the process of calculation,thus,it simplifies the process of calculation.Under not changing the secret key of other group member,the group member can be added or revoked efficiently.Analysis results show that this scheme has anonymity,unforgeability,traceability,coalition-resistance and coalition-replay attacks.

关 键 词：数字签名 群签名 中国剩余定理 有限域 离散对数 

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