Skip to main content

BLS Short Digital Signatures

  • Reference work entry

Related Concepts

Digital Signature Schemes; Random Oracle Model

Background

It is well known that a digital signature scheme (DSS) that produces signatures of length \(\ell\) can have security at most \({2}^{\ell}\). In other words, it is possible to forge a signature on any message in time \(O({2}^{\ell})\) just given the public key. It is natural to ask whether we can construct signatures with such security, i.e., signatures of length \(\ell\) where the best algorithm for creating an existential forgery (with constant success probability) under a chosen message attack takes time \(O({2}^{\ell})\). Concretely, is there a signature scheme producing 80-bit signatures where creating an existential forgery (with probability 1/2) takes time approximately \({2}^{80}\)?

Theory

DSS signatures and Schnorr signatures provide security \(O({2}^{\ell})\) with signatures that are \(4\ell\)-bits long. These signatures can be shortened [1] to about \(3.5\ell\)-bits without much affect on security....

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Naccache D, Stern J (2000) Signing on a postcard. In: Proceedings of financial cryptography, Anguilla, February 2000

    Google Scholar 

  2. Boneh D, Lynn B, Shacham H (2004) Short signatures from the Weil pairing. J Cryptol. Extended abstract in Boyd C (ed) Proceedings of ASIACRYPT 2001, Gold Coast, December 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin

    Google Scholar 

  3. Boneh D, Boyen X (2004) Short signatures without random oracles. In: Cachin C, Camenisch J (eds) Proceedings of eurocrypt 2004, Interlaken, May 2004. Lecture Notes in Computer Science, vol 3027. Springer, Berlin, pp 56–73

    Google Scholar 

  4. Zhang F, Safavi-Naini R, Susilo W (2004) An efficient signature scheme from bilinear pairings and its applications. In: Proceedings of PKC, Singapore, March 2004

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Boneh, D. (2011). BLS Short Digital Signatures. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_140

Download citation

Publish with us

Policies and ethics