不含双线性对运算的无证书签密方案  

Certificateless Signcryption Scheme Without Bilinear Pairings Calculation

作　　者：葛爱军[1] 陈少真[1] 

机构地区：[1]信息工程大学信息工程学院,郑州450002

出　　处：《计算机工程》2010年第20期147-149,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60673081);国家863"计划基金资助项目(2006AA01Z417)

摘　　要：当前无证书签密方案在具体应用时都要用到计算复杂的双线性对运算。针对该问题,提出一种安全的无需双线性对运算的无证书签密方案。该方案在随机预言模型下能够满足密文机密性和选择消息的不可伪造性,且安全性是基于离散对数难题和计算Diffie-Hellman难题的。实验结果表明,该方案具有明显的效率优势。To solve the problem of all the certificateless signcryption schemes in the literature are built from bilinear mappings on elliptic curves which need costly operations,this paper presents the first concrete pairing-free certificateless signcryption.This scheme is provably secure in the random oracle model,relative to the hardness of the discrete logarithm problem and computational Diffie-Hellman problem.As there is no pairing operation in the new scheme,this scheme is more computationally efficient than others built from bilinear mappings.

关 键 词：无证书密码 签密体制 随机预言模型 双线性对 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]