Short Signatures from the Weil Pairing
Dan Boneh, Ben Lynn, Hovav Shacham
Abstract
Boneh, Lynn, and Shacham (BLS) introduced a method for generating extremely short, verifiable digital signatures using pairings on elliptic curves. These signatures are uniquely 'aggregatable,' meaning that multiple signatures from different signers can be combined into a single, succinct signature that proves all individual signatures are valid. This capability is of immense importance to the blockchain industry, particularly for consensus mechanisms and sharded networks (such as Ethereum 2.0). By drastically reducing the data required to verify large groups of participants, the BLS signature scheme facilitates scalability and network efficiency. The paper details the mathematical basis for pairing-based cryptography, moving beyond the standard group operations to utilize bilinear mappings. This work is considered essential reading for those studying the scaling challenges of proof-of-stake networks, as it solves the problem of signature bloat in massive validator sets.
Key Findings
- 1Introduces a signature scheme that allows for signature aggregation.
- 2Provides a method for creating extremely compact digital signatures.
- 3Utilizes bilinear pairings to facilitate efficient multi-signature verification.
- 4Significantly reduces bandwidth and storage requirements for network consensus.
Topics
Citation
BibTeX
@misc{shortsignatures2001,
title = {Short Signatures from the Weil Pairing},
author = {Dan Boneh and Ben Lynn and Hovav Shacham},
year = {2001},
howpublished = {\url{https://link.springer.com/chapter/10.1007/3-540-45682-1_30}},
}Knowledge Explorer
Explore Related Concepts
See how Short Signatures from the Weil Pairing connects to glossary terms, books, and other research in the Knowledge Graph.