论文信息 - An Efficient Certificateless Signature from Pairings

An Efficient Certificateless Signature from Pairings

In this paper, we proposed a new certificateless signature based on bilinear pairings. The proposed scheme is more efficient than those of previous schemes by pre-computing the pairing e(P, P) = g and publishing as the system parameters, it needs not to compute the pairing in the Sign stage, and only needs to compute three pairings in the Verify stage. In addition, the proposed scheme does not need the special MaptoPoint hash function and the confidential channel between KGC and users. The proposed scheme is unforgeable under the hardness assumption of the q-strong Diffie-Hellman problem and Computational Diffie-Hellman problem.

[1] YoungJu Choie,et al. Efficient identity-based authenticated key agreement protocol from pairings , 2005, Appl. Math. Comput..

[2] Paulo S. L. M. Barreto,et al. Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps , 2005, ASIACRYPT.

[3] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[4] Guohong Xie,et al. An ID-Based Key Agreement Scheme from pairing , 2005, IACR Cryptol. ePrint Arch..

[5] Kenneth G. Paterson,et al. Certiflcateless Public Key Cryptography , 2003 .

[6] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[7] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[8] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[9] Kenneth G. Paterson,et al. Certificateless Public Key Cryptography , 2003 .

[10] Xiangxue Li,et al. Certificateless signature and proxy signature schemes from bilinear pairings , 2005 .

[11] Pil Joong Lee,et al. Generic Construction of Certificateless Signature , 2004, ACISP.

[12] Paulo S. L. M. Barreto,et al. On the Selection of Pairing-Friendly Groups , 2003, Selected Areas in Cryptography.