首页 | 本学科首页   官方微博 | 高级检索  
     

Breaking and Repairing Trapdoor-Free Group Signature Schemes from Asiacrypt 2004
作者姓名:Xin-Yi Huang  Willy Susilo  Yi Mu  and Fu-Tai Zhang
作者单位:[1]School of Information Technology and Computer Science, University of WoUongong, Wollongong, NSW 2522, Australia [2]School of Mathematics and Computer Science, Nanjing Normal University, Nanjing 210097, China
基金项目:This work is supported by ARC Discovery under Grant No. DP0557493, Ministry of Education of Jiangsu Province under Grant No. 03KJA520066, and Xidian University's 0pen Grant of Key Laboratory on Computer Network and Information Security of Ministry of Education of China.
摘    要:Group signature schemes allow a member of a group to sign messages anonymously on behalf of the group. in case of later dispute, a designated group manager can revoke the anonymity and identify the originator of a signature. In Asiacrypt2004, Nguyen and Safavi-Naini proposed a group signature scheme that has a constant-sized public key and signature length, and more importantly, their group signature scheme does not require trapdoor, Their scheme is very efficient and the sizes of signatures are smaller than those of the other existing schemes. In this paper, we point out that Nguyen and Safavi-Naini's scheme is insecure. In particular, it is shown in our cryptanalysis of the scheme that it allows a non-member of the group to sign on behalf of the group. And the resulting signature convinces any third party that a member of the group has indeed generated such a signature, although none of the members has done so. Therefore is in case of dispute, even the group manager cannot identify who has signed the message. In the paper a new scheme that does not suffer from this problem is provided.

关 键 词:数字签名  信息安全  密码系统  计算机  数据安全
收稿时间:3 August 2005
修稿时间:2005-08-032006-02-05

Breaking and Repairing Trapdoor-Free Group Signature Schemes from Asiacrypt’2004
Xin-Yi Huang,Willy Susilo,Yi Mu,and Fu-Tai Zhang.Breaking and Repairing Trapdoor-Free Group Signature Schemes from Asiacrypt 2004[J].Journal of Computer Science and Technology,2007,22(1):71-74.
Authors:Xin-Yi Huang  Willy Susilo  Yi Mu  Fu-Tai Zhang
Affiliation:1.School of Information Technology and Computer Science, University of WoUongong, Wollongong, NSW 2522, Australia ;2. School of Mathematics and Computer Science, Nanjing NoTnnal University, Nanjing 210097, China
Abstract:Group signature schemes allow a member of a group to sign messages anonymously on behalf of the group. In case of later dispute, a designated group manager can revoke the anonymity and identify the originator of a signature. In Asiacrypt2004, Nguyen and Safavi-Naini proposed a group signature scheme that has a constant-sized public key and signature length, and more importantly, their group signature scheme does not require trapdoor. Their scheme is very efficient and the sizes of signatures are smaller than those of the other existing schemes. In this paper, we point out that Nguyen and Safavi-Naini’s scheme is insecure. In particular, it is shown in our cryptanalysis of the scheme that it allows a non-member of the group to sign on behalf of the group. And the resulting signature convinces any third party that a member of the group has indeed generated such a signature, although none of the members has done so. Therefore is in case of dispute, even the group manager cannot identify who has signed the message. In the paper a new scheme that does not suffer from this problem is provided. This work is supported by ARC Discovery under Grant No. DP0557493, Ministry of Education of Jiangsu Province under Grant No. 03KJA520066, and Xidian University’s Open Grant of Key Laboratory on Computer Network and Information Security of Ministry of Education of China.
Keywords:digital signature  cryptography  information security
本文献已被 维普 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号