Cryptology ePrint Archive: Report 2007/250

Efficient and Provably-Secure Certificateless Short Signature Scheme from Bilinear Pairings

Hongzhen Du and Qiaoyan Wen

Abstract: In this paper, we 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. Our 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, our scheme requires less computation cost and significantly more efficient than all known CLS schemes, and the size of signatures generated by our 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.

Category / Keywords: public-key cryptography / certificateless signature, k-CAA, bilinear pairings

Date: received 25 Jun 2007

Contact author: duhongzhen at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20070626:074831 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]