强安全无对的无证书签名方案  

Strongly secure certificateless signature scheme without pairings

作　　者：王亚飞[1] 张睿哲[2] 

机构地区：[1]平顶山学院继续教育学院,河南平顶山467000 [2]平顶山学院计算机科学与技术学院,河南平顶山467000

出　　处：《通信学报》2013年第2期94-99,108,共7页Journal on Communications

基　　金：河南省科技攻关基金资助项目(102102210420)~~

摘　　要：无证书的公钥密码学解决了基于PKI的公钥密码学的证书管理问题,以及基于身份的公钥密码学的密钥托管问题。最近,王等提出了一个不含双线性对运算的无证书签名方案。然而,通过对其进行分析,发现此方案是完全不安全的(即敌手可以获取用户的私钥),并给出了具体的攻击方法。为了改进其安全性,提出了一个新的更安全的无对的无证书签名方案,并在随机预言机模型下基于离散对数困难问题给出了安全性证明。此外,新方案效率非常高,签名算法只需要1个点乘运算,验证算法需要3个点乘运算。Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity based cryptography. Recently, Wang et al. proposed a certificateless signature scheme without pairings. However, this scheme is completely insecure with a concrete attack method. A strongly secure pairing-free signature scheme is also proposed, which is provably secure in random oracle model under the assumption that the discrete logarithm problem is intractable. Furthermore, the efficiency of the pro： posed scheme is very high, since its signing algorithm only needs one scalar multiplication, and its verification algorithm needs three scalar multiplications.

关 键 词：可证明安全 双线性对 无证书签名 离散对数问题 

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