一种新的基于双线性对的群签名方案  

A New Group Signature Scheme Based on Bilinear Pairings

作　　者：赵怀勋[1] 朱英宏[1] 庞志斌[1] 

机构地区：[1]武警工程学院,710086

出　　处：《微计算机信息》2009年第36期76-77,共2页Control & Automation

基　　金：基金申请人:赵怀勋;基于椭圆曲线密码体制的电子商务安全认证机制研究;基金颁发部门:陕西省自然科学基金(2007F50)

摘　　要：针对现有的群签名方案通常使用传统的数字签名或者基于身份的数字签名来进行身份认证中存在的以下问题:用户的公钥需要经过可信第三方(TTP)签名的证书来保证其可靠性,或者用户的私钥将无法避免地被TTP所托管的问题。文章提出了一种新型的基于双线型对的群签名方案,运用了双线型对的算法,解决了身份认证过程中的密钥托管问题,简化了身份认证过程,提高了签名方案的效率和安全性。经过安全性和可行性分析,该方案能够抵抗联合攻击,安全可靠。At present,the electronic cash schemes always use the traditional digital signature cryptosystem or the identity-based public key cryptosystem. But there is two problem which is the certificates signed by third trusted party（TTP） are required to ensure the authenticity of the public keys of users or the key escrow of uses private keys is inherent. We propose a new group signature scheme based on bilinear pairings. We settle the problem of key escrow when verifying with the bilinear pairings. The scheme reduces the process of verification and increases the rate and efficiency. It show that the scheme can effectively resist every attacks and safety when we analyze its security and feasibility.

关 键 词：数字签名 双线性映射 群签名 

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