不使用双线性对的无证书签密方案  

A Certificateless Signcryption Scheme without Bilinear Pairing

作　　者：王翔[1] 祁正华[1] 黄海[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《计算机技术与发展》2017年第7期106-110,共5页Computer Technology and Development

基　　金：国家自然科学基金资助项目(61073188)

摘　　要：2003年,Paterson和Al-Riyami率先提出了无证书公钥密码体制。长时间以来因该体制无需进行身份密钥托管并且也不存在传统公钥证书管理困难的问题而备受关注。无证书签密方案中,采用双线性对的方案大多计算繁复,难以实用。为此,近年来提出了多种不采用双线性对的无证书签密方案,以提高方案的性能,但这些方案大多不具有保密性和抗伪造性。针对上述缺陷,文中提出了一种新的不使用双线性对的无证书签密方案。该方案能够抵抗前类方案中广泛存在的内部攻击和密钥线性化攻击。仿真验证结果表明,在随机预言模型下,所提方案具有不可伪造性、正确性和保密性。与已有方案相比,该方案同样有着较高的计算效率,签密过程仅仅进行4次点乘运算,解密校验阶段只需要2次点乘运算。The no certificate of public key cryptosystem has been firstly proposed by Paterson and Al-Riyami in 2003, which has been concerned due to disadvantages of unnecessary identity key escrow and no-existing difficulty for traditional certificate management. Inside the no certificate of public key cryptosystem, the computation for the scheme of biliuear pairings is large and complex, unsuitable for practical applications. Therefore, a variety of no certificate signing secret plan without bilinear pairings are proposed to improve the perform- ance in recent years. Unfortunately, these schemes have proved completely insecure in both confidentiality and resistance to forge when facing with the concrete attacks. Thus a new CLS scheme without pairings has been proposed which can resist the public key replacement attack and internal attack better than former schemes. Simulation results show that in the random oracle model the proposed scheme owns unforgeability, correctness and confidentiality and is more efficient than the existing schemes, in which only four point multiplications and two point multiplications are needed in signcryption and unsigncryption separately.

关 键 词：无证书签密方案 无双线性对 随机预言模型 信息安全 

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