Pairing-based cryptography

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group with a mapping e :G_1 \times G_2 \to G_T to construct or analyze cryptographic systems.

Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group with a mapping e :G_1 \times G_2 \to G_T to construct or analyze cryptographic systems.

Definition

The following definition is commonly used in most academic papers. Let \mathbb{F}_q be a finite field over prime q , G_1, G_2 two additive cyclic groups of prime order q , and G_T another cyclic group of order q written multiplicatively. A pairing is a map: e: G_1 \times G_2 \rightarrow G_T , which satisfies the following properties: Bilinearity: \forall a,b \in \mathbb{F}_q^*, P\in G_1, Q\in G_2:\ e\left(aP, bQ\right) = e\left(P, Q\right)^{ab} Non-degeneracy: If P generates G_1 and Q generates G_2 , then e(P,Q) generates G_T (i.e., e(P, Q) \neq 1 ). Computability: There exists an efficient algorithm to compute e . If the same group is used for the first two groups (i.e. G_1 = G_2 ), the pairing is called symmetric and is a mapping from two elements of one group to an element from a second group. Some researchers classify pairing instantiations into three (or more) basic types: G_1 = G_2 ; G_1 \ne G_2 but there is an efficiently computable homomorphism \phi : G_2 \to G_1 ; G_1 \ne G_2 and there are no efficiently computable homomorphisms between G_1 and G_2 .

Usage in cryptography

If symmetric, pairings can be used to reduce a hard problem in one group to a different, usually easier problem in another group. For example, in groups equipped with a bilinear mapping such as the Weil pairing or Tate pairing, generalizations of the computational Diffie–Hellman problem (CDH) are believed to be infeasible while the simpler decisional Diffie–Hellman problem (DDH) can be easily solved using the pairing function. The first group is sometimes referred to as a Gap Group because of the assumed difference in difficulty between these two problems in the group. To illustrate, let e : G \times G \to G_T be a symmetric, non-degenerate, efficiently computable bilinear pairing, where G is a multiplicative group with generator g . Consider an instance of the CDH problem: given g , g^x , and g^y , the goal is to compute g^{xy} . The pairing function e does not directly help us compute g^{xy} , leaving the CDH problem presumably intractable. However, given a candidate solution g^z , we can check if g^z = g^{xy} (thereby solving the DDH problem) without knowing x , y , or z , by testing if: e(g^x, g^y) = e(g, g^z) By using the bilinear property, we can pull the exponents out: e(g^x, g^y) = e(g, g)^{xy} and e(g, g^z) = e(g, g)^z Since G_T is a prime order group, the equality e(g, g)^{xy} = e(g, g)^z implies xy \equiv z \pmod q , validating the candidate answer. While first used for cryptanalysis, pairings have also been used to construct many cryptographic systems for which no other efficient implementation is known, such as identity-based encryption or attribute-based encryption schemes. Pairing-based cryptography is used in the KZG cryptographic commitment scheme and is exemplified in the BLS digital signature scheme.

References

External links

Lecture on Pairing-Based Cryptography Ben Lynn's PBC Library

Text derived from https://en.wikipedia.org/w/index.php?oldid=1364259200 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001364259200 · captured 1784117294.0 · version history

Cite this page as: encyclopegia.org, “Pairing-based cryptography”, snapshot enwiki-001364259200. https://encyclopegia.org/a/pairing-based-cryptography

Sources cited in this revision

Extracted from the cited revision's reference blocks; absent citations are not invented.