Boneh–Lynn–Shacham

A BLS digital signature, also known as Boneh–Lynn–Shacham (BLS), is a cryptographic signature scheme which allows a user to verify that a signer is ''authentic''.

The scheme uses a bilinear pairing $e: G_1\times G_2\to G_T$, where $G_1, G_2,$ and $G_T$ are elliptic curve groups of prime order $q$, and a hash function $H$ from the message space into $G_1$. Signature are elements of $G_1$, public keys are elements of $G_2$, and the secret key is an integer in ,q-1/math>. Working in an elliptic curve group provides some defense against index calculus attacks (with the caveat that such attacks are still possible in the target group $G_T$ of the pairing), allowing shorter signatures than FDH signatures for a similar level of security.

Signatures produced by the BLS signature scheme are often referred to as ''short signatures'', ''BLS short signatures'', or simply ''BLS signatures''. The signature scheme is provably secure (the scheme is existentially unforgeable under adaptive chosen-message attacks) in the random oracle model assuming the intractability of the computational Diffie–Hellman problem in a gap Diffie–Hellman group.

BLS signature scheme

A signature scheme consists of three functions: ''generate'', ''sign'', and ''verify''.

;Key generation
The key generation algorithm selects the private key by picking a random integer x\in ,q-1/math>. The holder of the private key publishes the public key, $g_2^x$, where $g_2$ is a generator of $G_2$.

;Signing
Given the private key $x$, and some message $m$, we compute the signature by hashing the bitstring $m$, as $h=H(m)$, and we output the signature $\sigma=h^x$.

;Verification
Given a signature $\sigma$ for message $m$ and public key $g_2^x$, we verify that $e(\sigma, g_2 )=e(H(m), g_2^x)$.

Properties

*Unique and deterministic: for a given key and message, there is only one valid signature (like RSA PKCS1 v1.5, EdDSA and unlike RSA PSS, DSA, ECDSA, Schnorr and ML-DSA).
*Signature Aggregation: Multiple signatures generated under multiple public keys for multiple messages can be aggregated into a single signature.D. Boneh, C. Gentry, H. Shacham, and B. Lyn
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
proceedings of Eurocrypt 2003, LNCS 2656, pp. 416-432, 2003
*Simple Threshold Signatures and multisignatures.

Curves

BLS12-381

BLS12-381 is part of a family of elliptic curves named after Barreto, Lynn, and Scott (a different BLS trio, except for the L). It was designed by Sean Bowe in early 2017 as the foundation for an upgrade to the Zcash protocol. It is both pairing-friendly, making it efficient for digital signatures, and effective for constructing zkSnarks. The planned usage of BLS12-381 for BLS signatures is detailed in the June 2022 IETF internet draft.

Implementations

* Chia network has used BLS signatures.
* By 2020, BLS signatures were used extensively in version 2 (Eth2) of the Ethereum blockchain, as specified in the IETF draft BLS signature specification—for cryptographically assuring that a specific Eth2 validator has actually verified a particular transaction. The use of BLS signatures in Ethereum is considered a solution to the verification bottleneck only for the medium term, as BLS signatures are not quantum secure. Over the longer term—say, 2025–2030— STARK aggregation is expected to be a drop-in replacement for BLS aggregation.
* Dfinity (developers of the "Internet Computer" cryptocurrency) uses a BLS implementation.
* Skale cryptocurrency uses BLS signature algorithm.
* drand uses the BLS12-381 curve as a threshold scheme.

See also

*Pairing-based cryptography

References

External links

Summary description of the Algorand draft standard effortBen Lynn's PBC LibraryChia Network's BLS signatures implementation (C++)

{{DEFAULTSORT:Boneh-Lynn-Shacham
Digital signature schemes

Pairing-based cryptography