Short Signatures from the Weil Pairing

  • Authors:
  • Dan Boneh;Ben Lynn;Hovav Shacham

  • Affiliations:
  • Computer Science Department, Stanford University, Stanford, CA 94305, USA;Computer Science Department, Stanford University, Stanford, CA 94305, USA;Computer Science Department, Stanford University, Stanford, CA 94305, USA

  • Venue:
  • Journal of Cryptology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.