A Secure and Effcient Certificateless Signature Scheme Using Bilinear Pairing

Recent years, certificateless signatureshave got fruitful achievements. However, some of the mosteffcient schemes are vulnerable to the key replacementattack. We present an effcient certificateless signaturescheme from bilinear parings, which is up to now the mosteffcient provably-secure scheme compared with other existing schemes in the literature. The security of our schemeis proved based on the intractability of the computationalDiffe-Hellman problem in the random oracle model.