[BLS04] Short Signatures from the Weil Pairing

Authors: Dan Boneh, Ben Lynn, Hovav Shacham | Venue: Journal of Cryptology 2004 | Source

Abstract

We introduce a short signature scheme based on the Computational Diffie–Hellman assumption on certain elliptic and hyperelliptic curves. For standard security parameters, the signature length is about half that of a DSA signature with a similar level of security. Our short signature scheme is designed for systems where signatures are typed in by a human or are sent over a low-bandwidth channel. We survey a number of properties of our signature scheme such as signature aggregation and batch verification.

BibTeX

Copy

@Article{JC:BonLynSha04,
  author = {Dan Boneh and Ben Lynn and Hovav Shacham},
  title = {Short Signatures from the {Weil} Pairing},
  pages = {297--319},
  journal = {Journal of Cryptology},
  volume = {17},
  number = {4},
  month = {sep},
  publisher = {Springer},
  year = {2004},
  doi = {10.1007/s00145-004-0314-9},
}