Efficient certificateless signature scheme

The traditional digital signature schemes need much more storage and management costs for the effective use of certificates,while the identity-based digital signature schemes fail to solve the inherent key-escrow problem.Certificateless signature schemes can sign and verify with no certificates and they do not suffer from the key-escrow problem,and so certificateless signature schemes have received much more attention recently.This paper proposes a certificateless signature scheme from bilinear pairings,and verifies its security under the random oracle machine.The certificateless signature scheme needs only two bilinear pairing operations in the signing and verifying phases.The security of the signature scheme is under the assumption of the computational Diffie-Hellman problem.The performance analysis shows that this scheme is much more efficient than other previous signature schemes.