The Full Wiki

More info on BLS (cryptography)

BLS (cryptography): Wikis


Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.


From Wikipedia, the free encyclopedia

In cryptography, the Boneh–Lynn–Shacham signature scheme allows a user to verify that a signer is authentic. The scheme uses a pairing function for verification and signatures are group elements in some elliptic curve. Working in an elliptic curve provides defense against index calculus attacks against allowing shorter signatures than FDH signatures. Signatures are often referred to as short signatures, BLS short signatures, or simply BLS signatures. The signature scheme is provably secure (that is, the scheme is existentially unforgeable under adaptive chosen-message attacks) assuming both the existence of random oracles and the intractability of the computational Diffie–Hellman problem. [1]


Pairing functions

A gap group is a group in which the computational Diffie–Hellman problem is intractable but the decisional Diffie–Hellman problem can be efficiently solved. Non-degenerate, efficiently computable, bilinear pairing functions permit such groups.

Let e\colon G\times G\rightarrow G_T be a non-degenerate, efficiently computable, bilinear pairing function where G, GT are groups of prime order, r. Let g be a generator of G. Consider an instance of the CDH problem, g,gx, gy. Intuitively, the pairing function e does not help us compute gxy, the solution to the CDH problem. It is conjectured that this instance of the CDH problem is intractable. Given gz, we may check to see if gz = gxy without knowledge of x, y, and z, by testing whether e(gx,g y) = e(g,gz) holds.

By using the bilinear property x + y + z times, we see that if e(gx,g y) = e(g,g)xy = e(g,g)z = e(g,gz), then since GT is a prime order group, xy = z.

The scheme

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


Key generation

The key generation algorithm selects a random integer x in the interval [0, r − 1]. The private key is x. The holder of the private key publishes the public key, gx.


Given the private key x, and some message m, we compute the signature by hashing the bitstring m, as h = H(m). We output the signature σ = hx.


Given a signature σ and a public key gx, we verify that e(σ,g) = e(H(m),gx).


  1. ^ Dan Boneh, Ben Lynn, and Hovav Shacham (2004). "Short Signatures from the Weil Pairing". Journal of Cryptology 17: 297–319.  


Got something to say? Make a comment.
Your name
Your email address