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

当前无证书签密方案在具体应用时都要用到计算复杂的双线性对运算。针对该问题，提出一种安全的无需双线性对运算的无证书签密方案。该方案在随机预言模型下能够满足密文机密性和选择消息的不可伪造性，且安全性是基于离散对数难题和计算Diffie- Hellman难题的。实验结果表明，该方案具有明显的效率优势。

Certificateless Signcryption Scheme Without Bilinear Pairings Calculation

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.