基于双线性对的高效无证书签名方案  

Efficient certificateless signature scheme based on bilinear parings

作　　者：张玉磊[1] 王彩芬[1] 张永洁 程文华[1] 韩亚宁[1] 

机构地区：[1]西北师范大学数学与信息科学学院,兰州730070 [2]甘肃省卫生学校,兰州730000

出　　处：《计算机应用》2009年第5期1330-1333,共4页journal of Computer Applications

基　　金：教育部科学技术研究重点资助项目(208148);甘肃省教育厅重点资助项目(0801-01);西北师范大学青年教师科研基金资助项目(NWNU-QN-07-37)

摘　　要：为了避免身份密码系统中密钥托管问题,出现了无证书密码系统。基于双线性对提出了一个高效的无证书签名方案。在方案中,签名算法需要一个指数运算,验证算法仅需要一个对运算和一个指数运算。与许多已有方案相比,具有较高的效率。方案的安全性依赖于q-SDH困难问题和Inv-CDH困难问题,并在随机预言机模型下,证明能够抵抗适应性选择消息攻击下的存在性伪造。Due to eliminating the inherent key escrow in identity-based cryptosystem, the certificateless public key cryptosystem came into being. A new efficient certificateless signature scheme based on bilinear pairing was put forward. The signing algorithm did not need any pairing computation but need one exponentiation computation, and the verification algorithm only needed one pairing and one exponentiation computation. The new scheme is more efficient than other exsiting schemes in terms of computation overhead. Furthermore, the security relies on the hardness of the q-Strong Diffie-Hellman （ q -SDH） problem and Inverse-Compute Diffie-Hellman （Inv-CDH） problem. Under the random oracle model, the new scheme is proved to be secure against existential forgery on adaptively chosen message attack.

关 键 词：双线性对 q—SDH问题 Inv—CDH问题 无证书签名 

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