Efficient and Provably-Secure Certificateless Short Signature Scheme From Bilinear Pairings
In this paper, the authors present a CertificateLess Signature (CLS) scheme that is proved to be secure in the random oracle model under the hardness assumptions of k-CAA and Inv-CDHP. The scheme upholds all desirable properties of previous CLS schemes, and requires general cryptographic hash functions instead of the MapToPoint hash function which is inefficient and probabilistic. Furthermore, the scheme requires less computation cost and significantly more efficient than all known CLS schemes, and the size of signatures generated by the scheme is approximate 160 bits, which is the shortest certificateless signatures so far. So it can be used widely, especially in low-bandwidth communication environments.