一种高效群签名方案的密码学分析

谢琪

doi:10.3724/SP.J.1146.2005.01046

一种高效群签名方案的密码学分析

doi: 10.3724/SP.J.1146.2005.01046

谢琪

基金项目:

国家自然科学基金(10271037)和浙江省自然科学基金(Y105067)资助课题

计量
- 文章访问数: 3218
- HTML全文浏览量: 113
- PDF下载量: 624
- 被引次数: 0
出版历程
- 收稿日期: 2005-08-23
- 修回日期: 2006-06-20
- 刊出日期: 2007-06-19

Cryptanalysis of an Efficient Group Signature Scheme

Xie Qi

摘要

摘要: 2005年，张键红等提出了一种基于RSA的高效群签名方案，签名与验证的计算量只需要9次模幂乘运算。该文提出了一种伪造攻击方案指出张等的方案是不安全的，任一群成员在撤消中心的帮助下可以不利用自己的秘密参数对任何消息生成有效的群签名。同时，指出了群成员的识别算法是错误的，身份追踪式是与具体签名无关的常量，即身份追踪算法无法追踪到真实的签名者。最后，指出了他们的方案具有关联性。
- 群签名;RSA;密码学
Abstract: In 2005, Zhang et al. proposed an efficient group signature scheme based on RSA, the total computation cost of signature and verification requires only 9 modular exponentiations. This paper will show that Zhang et al.s scheme is insecure, any group member colludes with repeal center can generate a valid group signature without using his secret parameters. Additional, it will show that the signer identity verification algorithm is error, identity verification expression is independent of the group signature. That is, the signer identity verification algorithm cannot find who the signer is. Finally, it will show that their scheme is not unlinkable.

HTML全文

参考文献(1)

Chaum D and Heyst F. Group signature[A]. EUROCRYPT91, LNCS 547, Berlin: Springer-verlag, 1992: 257-265.[2]Wang G L. Security analysis of several group signature schemes[A]. In: Indocrypt2003, LNCS2904, Berlin: Springer-Verlag, 2003: 252-265.[3]Joye M, Lee N Y, and Hwang T. On the security of the Lee-Chang group signature scheme and its derivatives[A]. In: Information Security (ISW'99), LNCS 1729, Berlin: Springer-Verlag, 1999: 47-51.Joye M, Kim S, and Lee N Y. Cryptanalysis of two group signature schemes[A]. In: Information Security (ISW'99), LNCS 1729, Berlin: Springer-Verlag, 1999: 271-275.[4]Wang G L. On the security of a group signature scheme with forward security[A]. In: Information Security and Cryptography (ICISC 2003), LNCS 2971, Berlin: Springer-Verlag, 2004: 27-39.[5]Lysyanskaya A and Ramzan Z. Group blind signature: A scalable solution to electronic cash[A]. Financial Cryptography (FC '98), LNCS 1465, Berlin:Springer-Verlag, 1998: 184-197.[6]Tseng Y M and Jan J K. Improved group signature scheme based on the discrete logarithm problem[J].Electron. Lett.1999, 35(1):37-38[7]Sun H M. Comment: Improved group signature scheme based on the discrete logarithm problem[J].Electron. Lett.1999, 35(16):1323-1324[8]Ateniese G, Camenisch J, Joye M, and Tsudik G. A practical and provably secure coalition-resistant group signature scheme[A]. In: CRYPTO 2000, LNCS1880, Berlin: Springer-Verlag, 2000: 255-270.[9]张键红，伍前红，邹建成，王育民. 一种高效的群签名[J]. 电子学报，2005, 33(6): 1113-1115. Zhang J H, Wu Q H, Zou J C, and Wang Y M. An efficient group signature scheme[J]. Acta Electronica Sinca, 2005, 33(6): 1113-1115.

施引文献

资源附件(0)

访问统计