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

Improved group signature scheme based on Chinese remainder theorem

研究了陈泽文等提出的基于中国剩余定理的群签名方案,指出陈泽文方案中生成签名算法有缺陷.分析了李俊等提出的强RSA假设下的基于中国剩余定理的群签名方案,发现李俊方案不能够有效防止联合攻击和伪造攻击.参照DSA(digital signature algorithm)签名算法,提出了一种改进的基于中国剩余定理的群签名方案.在不改变其他有效群成员密钥的情况下,简单高效地实现了群成员的加入和撤销.分析表明该方案具有防联合攻击、重放攻击、伪造攻击和陷害攻击等优点,通过预先计算签名的部分参数可以提高群签名的处理速度.

The group signature scheme based on Chinese remainder theorem proposed by Chen Zewen et al. has been studied, and the design flaw in the signature generation algorithm in Chen＇s scheme is presented. Furthermore, Li Jun＇s scheme on the strong RSA assumption based on Chinese remainder theorem has been analyzed. The analysis reveals its vulnerability to joint attack or forgery attack. Thus, according to the digital signature algorithm （DSA）, an improved scheme based on Chinese remainder theorem is proposed. The group member can be added or revoked efficiently and effectively without changing the other group member＇s secret key. Analyses show that the improved scheme can resist joint attack, replay attack, forgery attack and trap attack. In addition, the improved scheme offers a means to optimize the group signature to speed up the calculation by pre-calculating some signature parameters.