Certificateless public key cryptography was introduced to avoid the inherent key escrow problem in identity-based cryptography, and eliminate the use of certificates in traditional PKI. Most cryptographic schemes in certificateless cryptography are built from bilinear mappings on elliptic curves which need costly operations. Despite the investigation of certificateless public key encryption without pairings, certificateless signature without pairings received much less attention than what it deserves. In this paper, we present a concrete pairing-free certificateless signature scheme for the first time. Our scheme is more computationally efficient than others built from pairings. The new scheme is provably secure in the random oracle model assuming the hardness of discrete logarithm problem.
Ge, A., Chen, S. & Huang, X. (2009). A concrete certificateless signature scheme without pairings. First International Conference on Multimedia Information Networking and Security, MINES 2009 (pp. 374-377). California, USA: The Institute of Electrical and Electronics Engineers, Inc..