International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2001: Advances in Cryptology — ASIACRYPT 2001 pp 514-532

Short Signatures from the Weil Pairing

  • Dan Boneh
  • Ben Lynn
  • Hovav Shacham
Conference paper

DOI: 10.1007/3-540-45682-1_30

Volume 2248 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Boneh D., Lynn B., Shacham H. (2001) Short Signatures from the Weil Pairing. In: Boyd C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg

Abstract

We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Dan Boneh
    • 1
  • Ben Lynn
    • 1
  • Hovav Shacham
    • 1
  1. 1.Computer Science DepartmentStanford UniversityUSA