A secure and efficient certificateless signature scheme using bilinear pairing

Recent years, certificateless signatures have got fruitful achievements. However, some of the most efficient schemes are vulnerable to the key replacement attack. We present an efficient certificateless signature scheme from bilinear parings, which is up to now the most efficient provably-secure scheme compared with other existing schemes in the literature. The security of our scheme is proved based on the intractability of the computational Diffie-Hellman problem in the random oracle model.