An efficient certificateless signature scheme

An efficient certificateless signature scheme based on bilinear pairing is proposed. The security of the scheme depends on the assumption of intractability such as the computational Diffie-Hellman (CDH) and discrete logarithm problem (DLP). The existential unforgeability of this scheme is proved under adaptively chosen message attack against both types of adversaries in the random oracle model. The performance of the scheme is analyzed and compared with those of other schemes. The results show that the sign algorithm requires three scalar multiplications and one hash operation. The verifying algorithm requires three pairing operations and two hash operations, so the scheme is more efficient than others.