| 摘要: |
| 近几年,仅提出了6 个无证书签密方案,其中大部分不能提供保密性和不可伪造性.即使有些签密方案是安全的,它们也都需要双线性对运算.为了解决上述问题,提出了一个无需对运算的无证书签密方案,并在随机预言模型下,基于计算Diffie-Hellman 假设和离散对数困难问题证明了其保密性和认证性.该方案无需双线性对操作.到目前为止,它是己知最有效的无证书签密方案. |
| 关键词: 签密 无证书 随机预言模型 计算Diffie-Hellman 假设 |
| DOI：10.3724/SP.J.1001.2011.03891 |
| 分类号: |
| 基金项目:国家高技术研究发展计划(863)(2009AA01Z415) |
|
| Certificateless Signcryption Scheme Without Bilinear Pairing |
|
LIU Wen-Hao, XU Chun-Xiang
|
|
School of Computer Science and Engineering, University of Electronic Science and Technology, Chengdu 611731, China
|
| Abstract: |
| Only six certificateless signcryption schemes have been proposed in recent years. Most of them cannot provide confidentiality and authentication. Even if some of them are secure, all of them need pairing operations. In order to solve the above-mentioned problems, a pairing-free certificateless signcryption scheme is proposed, and its security has proven to be in the random oracle model (ROM) under the computational Diffie-Hellman (CDH) assumption and the hardness of discrete logarithm problem (DLP). This scheme eliminates pairing operations and is the most efficient certificateless signcryption scheme. |
| Key words: signcryption certificateless ROM (random oracle model) CDH (computational Diffie-Hellman) assumption |
