An Efficient Certificateless Signature Scheme from Bilinear Parings

A Certificateless signature scheme retains the efficiency of Shamir´s, but it avoids the inherent key-escrow problem of the identity-based signature scheme. In this paper, we will propose a new Certificateless signature scheme from bilinear pairings. The proposed scheme is much more efficient than those previous Certificateless signature schemes by avoiding the Map to Point hash functions and decreasing the number of the bilinear pairing map operations. In the signing phase, no bilinear pairing operations are needed, and in the verifying phase, only 2 bilinear pairing operations are needed. All this contributes to the efficiency of the proposed scheme. The proposed scheme is unforgeable under the hardness assumptions of the q-strong Diffie-Hellman problem and the computational Diffie-Hellman problem.