Colluding attacks on a group signature scheme  

作　　者：郭兴阳 唐朝京 

机构地区：[1]School of Electronic Science and Engineering,National University of Defense Technology, Changsha 410073,China,School of Telecommunication Engineering, Air Force Engineering University, Xi’an 710077,China [2]School of Electronic Science and Engineering,National University of Defense Technology, Changsha 410073,China

出　　处：《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》2005年第10期1011-1014,共4页浙江大学学报（英文版）A辑（应用物理与工程）

基　　金：Project (No. 60472032) supported by the National Natural Science Foundation of China

摘　　要：Xie and Yu (2005) proposed a group signature scheme and claimed that it is the most efficient group signature scheme so far and secure. In this paper, we show that two dishonest group members can collude to launch two attacks on the scheme. In the first attack they can derive the group secret key and then generate untraceable group signatures. In the second attack, they can impersonate other group members once they see their signatures. Therefore we conclude that the signature scheme is not secure. We show that some parameters should be carefully selected in the scheme to resist our attacks.Xie and Yu （2005） proposed a group signature scheme and claimed that it is the most efficient group signature scheme so far and secure. In this paper, we show that two dishonest group members can collude to launch two attacks on the scheme. In the first attack they can derive the group secret key and then generate untraceable group signatures. In the second attack, they can impersonate other group members once they see their signatures. Therefore we conclude that the signature scheme is not secure. We show that some parameters should be carefully selected in the scheme to resist our attacks.

关 键 词：Group signature Colluding attack Factoring problem 

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