• Source: Pairing-based cryptography

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


×

G

2


→

G

T




{\displaystyle 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





F


q




{\displaystyle \mathbb {F} _{q}}

be a finite field over prime



q


{\displaystyle q}

,




G

1


,

G

2




{\displaystyle G_{1},G_{2}}

two additive cyclic groups of prime order



q


{\displaystyle q}

and




G

T




{\displaystyle G_{T}}

another cyclic group of order



q


{\displaystyle q}

written multiplicatively. A pairing is a map:



e
:

G

1


×

G

2


→

G

T




{\displaystyle e:G_{1}\times G_{2}\rightarrow G_{T}}

, which satisfies the following properties:

Bilinearity




∀
a
,
b
∈


F


q


∗


,
P
∈

G

1


,
Q
∈

G

2


:

e

(

a
P
,
b
Q

)

=
e


(

P
,
Q

)


a
b




{\displaystyle \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




e
≠
1


{\displaystyle e\neq 1}


Computability
There exists an efficient algorithm to compute



e


{\displaystyle e}

.




Classification


If the same group is used for the first two groups (i.e.




G

1


=

G

2




{\displaystyle 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




{\displaystyle G_{1}=G_{2}}

;





G

1


≠

G

2




{\displaystyle G_{1}\neq G_{2}}

but there is an efficiently computable homomorphism



ϕ
:

G

2


→

G

1




{\displaystyle \phi :G_{2}\to G_{1}}

;





G

1


≠

G

2




{\displaystyle G_{1}\neq G_{2}}

and there are no efficiently computable homomorphisms between




G

1




{\displaystyle G_{1}}

and




G

2




{\displaystyle 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 are believed to be infeasible while the simpler decisional Diffie–Hellman problem 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.
Let



e


{\displaystyle e}

be a non-degenerate, efficiently computable, bilinear pairing. Let



g


{\displaystyle g}

be a generator of



G


{\displaystyle G}

. Consider an instance of the CDH problem,



g


{\displaystyle g}

,




g

x




{\displaystyle g^{x}}

,




g

y




{\displaystyle g^{y}}

. Intuitively, the pairing function



e


{\displaystyle e}

does not help us compute




g

x
y




{\displaystyle g^{xy}}

, the solution to the CDH problem. It is conjectured that this instance of the CDH problem is intractable. Given




g

z




{\displaystyle g^{z}}

, we may check to see if




g

z


=

g

x
y




{\displaystyle g^{z}=g^{xy}}

without knowledge of



x


{\displaystyle x}

,



y


{\displaystyle y}

, and



z


{\displaystyle z}

, by testing whether



e
(

g

x


,

g

y


)
=
e
(
g
,

g

z


)


{\displaystyle e(g^{x},g^{y})=e(g,g^{z})}

holds.
By using the bilinear property



x
+
y
+
z


{\displaystyle x+y+z}

times, we see that if



e
(

g

x


,

g

y


)
=
e
(
g
,
g

)

x
y


=
e
(
g
,
g

)

z


=
e
(
g
,

g

z


)


{\displaystyle e(g^{x},g^{y})=e(g,g)^{xy}=e(g,g)^{z}=e(g,g^{z})}

, then, since




G

T




{\displaystyle G_{T}}

is a prime order group,



x
y
=
z


{\displaystyle xy=z}

.
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. Thus, the security level of some pairing friendly elliptic curves have been later reduced.
Pairing-based cryptography is used in the KZG cryptographic commitment scheme.
A contemporary example of using bilinear pairings is exemplified in the BLS digital signature scheme.
Pairing-based cryptography relies on hardness assumptions separate from e.g. the elliptic-curve cryptography, which is older and has been studied for a longer time.




Cryptanalysis


In June 2012 the National Institute of Information and Communications Technology (NICT), Kyushu University, and Fujitsu Laboratories Limited improved the previous bound for successfully computing a discrete logarithm on a supersingular elliptic curve from 676 bits to 923 bits.
In 2016, the Extended Tower Number Field Sieve algorithm allowed to reduce the complexity of finding discrete logarithm in some resulting groups of pairings. There are several variants of the multiple and extended tower number field sieve algorithm expanding the applicability and improving the complexity of the algorithm. A unified description of all such algorithms with further improvements was published in 2019. In view of these advances, several works provided revised concrete estimates on the key sizes of secure pairing-based cryptosystems.




References






External links


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

Kata Kunci Pencarian:

• Pairing-based cryptography
• Pairing
• BLS digital signature
• Weil pairing
• XDH assumption
• Elliptic-curve cryptography
• Public-key cryptography
• Identity-based cryptography
• Non-interactive zero-knowledge proof
• Dan Boneh