An Efficient Certificateless Signature Scheme
An Efficient Certificateless Signature Scheme
复制标题
DOI：
10.1007/11807964_33
复制
发表时间：
2006-08
期刊：
影响因子：
--
通讯作者：
W. Yap;Swee-Huay Heng;B. Goi
中科院分区：
文献类型：
--
作者：
W. Yap;Swee-Huay Heng;B. Goi
无证书公钥密码体制（CLPKC）是解决基于身份密码体制（IBC）固有的密钥托管问题的一种新方法。而无证书签名是CLPKC中最重要的安全原语之一，目前文献中提出的方案相对较少。本文利用计算Diffie-Hellman问题的难解性构造了一个高效的无证书签名方案。通过使用较短的公钥，可以在验证算法中节省两次配对计算。此外，在签名算法中不需要配对计算。该方案在随机预言机模型下是存在不可伪造的。我们还提出了一个扩展的结构，其信任级别是相同的传统的签名方案。
Certificateless public key cryptography (CLPKC) is a paradi-gm to solve the inherent key escrow problem suffered by identity-based cryptography (IBC). While certificateless signature is one of the most important security primitives in CLPKC, there are relatively few proposed schemes in the literature. In this paper, we manage to construct an efficient certificateless signature scheme based on the intractability of the computational Diffie-Hellman problem. By using a shorter public key, two pairing computations can be saved in the verification algorithm. Besides, no pairing computation is needed in the signing algorithm. The proposed scheme is existential unforgeable in the random oracle model. We also present an extended construction whose trust level is the same as that of a traditional signature scheme.