Paper 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
certificateless signaturek-CAAbilinear pairings
Contact author(s)
duhongzhen @ gmail com
History
2007-06-26: received
Short URL
https://ia.cr/2007/250
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/250,
      author = {Hongzhen Du and Qiaoyan Wen},
      title = {Efficient and Provably-Secure Certificateless Short Signature Scheme from Bilinear Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2007/250},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/250}},
      url = {https://eprint.iacr.org/2007/250}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.