一种动态群签名方案  

A DYNAMIC GROUP SIGNATURE SCHEME

作　　者：吴克力[1] 孙抗毒[1] 朱保平[2] 刘凤玉[2] 

机构地区：[1]淮阴师范学院计算机科学系,江苏淮安223001 [2]南京理工大学计算机科学与技术系,江苏南京210094

出　　处：《计算机应用与软件》2007年第9期26-29,共4页Computer Applications and Software

基　　金：国家自然科学基金(60273035);国防科工委应用基础基金(J1300D004);江苏省高校自然科学研究指导性项目(03JKD520055)

摘　　要：最近,Bellare,Shi和Zhang提出一个动态群签名模型。依据该模型,提出了一个基于双线性对的动态群签名方案,它实现了动态群签名模型的各种功能。该方案有下列特点:在建群阶段不需要确定成员的数目并且群公钥固定不变;任何时候实体都能通过群权威加入到群中获得签名私钥并且无需更新其他成员的签名私钥;能通过群权威揭示签名人的身份并且这一过程是可验证的。该方案的安全性是建立在间隙群上计算Diffie-Hellaman问题和离散对数问题均是困难问题的基础上。Recently, a dynamic group signature model is proposed by Bellare, Shi and Zhang. A new dynamic group signature scheme based on bilinear pairing is presented according to the model,and it realizes the functions of the model. This scheme has three merits. First,the number of group members is not fixed in the setup phase and the group public key is unchanged. Second, an entity can join the group at any time and obtain a private signing key without refashioning other group members＇ private signing key. Third,the identity of the group signature can be open by the authority and the procedure of the tracing can be check by anybody. The security of the dynamic group signature is based on the fact that the gap Difl^e-Hellman problem and discrete logarithm problem are hard problems.

关 键 词：动态群签名 环签名 双线性对 

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