新的无随机预言的短群签名方案  

New short group signature scheme without random oracles

作　　者：袁艳[1] 蔡光兴[1] 

机构地区：[1]湖北工业大学理学院,武汉430000

出　　处：《计算机应用》2011年第3期790-792,797,共4页journal of Computer Applications

摘　　要：在BBS短群签名方案的基础上,基于强Diffie-Hellman(SDH)假设和判定性线性Diffie-Hellman假设,提出了一种标准模型下的短群签名方案。并证明了方案的安全性满足完全匿名性和完全可追踪性。与目前较新的在标准模型下已证明安全的方案相比,该方案具有较短的签名长度和更高的运行效率,且允许新成员的加入。On the basis of BBS short group signature scheme, a new short group signature scheme based on the Strong Diffie-Hellman （SDH） assumptions and the decision linear assumption was constructed. The scheme was verified to satisfy the security demand of full anonymity and full traceability. Compared with the latest schemes security in the standard model, this scheme has shorter length of group signature and higher operation efficiency, and it allows new members to join in the group.

关 键 词：标准模型 短群签名 完全匿名性 完全可追踪性 

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