一种有效的无证书签名方案  

An efficient certificateless signature scheme

作　　者：苏万力[1,2] 李晖[1] 张跃宇[1] 王育民[1] 

机构地区：[1]西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西西安710071 [2]青岛农业大学信息科学与工程学院,山东青岛266109

出　　处：《江苏大学学报（自然科学版）》2009年第4期401-404,423,共5页Journal of Jiangsu University：Natural Science Edition

基　　金：国家"863"计划项目(2007AA01Z435);国家自然科学基金资助项目(60473027;60772136)

摘　　要：基于双线性对设计了一种有效的无证书签名方案,其安全性依赖于计算Diffie-Hellman(CDH)困难问题和离散对数困难问题的假设.在随机预言机模型下,证明了新方案能够抵抗适应性选择消息攻击下的存在性伪造.分析新方案的性能,并与其他方案进行了对比.结果表明,该方案的签名过程仅需要群上的3个乘运算和一个哈希运算,验证过程仅需3个双线性对运算和2个哈希运算,其运算效率明显提高.An efficient certificateless signature scheme based on bilinear pairing is proposed. The security of the scheme depends on the assumption of intractability such as the computational Diffie - Hellman （CDH） and discrete logarithm problem （DLP）. The existential unforgeability of this scheme is proved under adaptively chosen message attack against both types of adversaries in the random oracle model. The performance of the scheme is analyzed and compared with those of other schemes. The results show that the sign algorithm requires three scalar muhiplications and one hash operation. The verifying algorithm requires three pairing operations and two hash operations, so the scheme is more efficient than others.

关 键 词：无证书签名 双线性对 随机预言机模型 基于身份签名 Diffie—Hellman问题 离散对数问题 

分 类 号：TN918.1[电子电信—通信与信息系统]