兩種群簽名方案的安全性分析
Security Cryptanalysis of Two Group Signature Schemes
-
摘要: 群簽名允許群成員以匿名的方式代表整個(gè)群體對(duì)消息進(jìn)行簽名。而且,一旦發(fā)生爭(zhēng)議,群管理員可以識(shí)別出簽名者。該文對(duì)Posescu(2000)群簽名方案和Wang-Fu(2003)群簽名方案進(jìn)行了安全性分析,分別給出一種通用偽造攻擊方法,使得任何人可以對(duì)任意消息產(chǎn)生有效群簽名,而群權(quán)威無法追蹤到簽名偽造者。因此這兩個(gè)方案都是不安全的。
-
關(guān)鍵詞:
- 群簽名; 偽造攻擊; 不關(guān)聯(lián)性
Abstract: Group signature schemes allow a group member to anonymously sign on groups behalf. Moreover, in case of anonymity misuse.a group manager can recover the issuer of a signature. This paper analyzes the security of two group signature schemes recently proposed respectively by Posescu (2000) and Wang Xiaoming (2003), and shows that both schemes are universally forgeable, that is, anyone (not necessarily a group member) is able to produce a valid group signature on an arbitrary message, which cannot be traced by the group manager. So both schemes are insecure. -
Chaum D, van Heijst. Group signatures. In Advances in Cryptology-EUROCRYPT91, LNCS 547, Springer-Verlag,1991:257 - 265.[2]Tseng Yuh-Min, Jan Jinn-Ke. A novel ID-based group signature.In T. L. Hwang and A. K. Lenstra, editors, 1998 International Computer Symposium, Workshop on Cryptology and Information Security, Tainan, December 17 - 19, 1998:159 - 164.[3]Lee Wei-Bin, Chang Chin-Chen. Efficient group signature scheme based on the discrete logarithm[J].IEE Proc. Comput. Digit.Tech.1998, 145(1):15-[4]Tseng Yuh-Min, Jan Jinn-Ke. Improved group signature scheme based on discrete logarithm problem[J].Electronics Letters.1999,35(1):37-[5]Popescu C. A modification of the Tseng-Jan group signature scheme. Studia Universitatis Babes-Bolyai Informatica, 2000,XLV(2): 36 - 40.[6]王曉明,符方偉.一個(gè)安全的群簽名方案[J].電子與信息學(xué)報(bào).2003,25(5):657-663瀏覽 -
計(jì)量
- 文章訪問數(shù): 2289
- HTML全文瀏覽量: 99
- PDF下載量: 778
- 被引次數(shù): 0
下載:
