Pairing-based cryptography: Difference between revisions

Revision as of 17:10, 15 November 2017

Revision as of 19:36, 13 March 2018

Line 22:

For example, in groups equipped with a [[bilinear mapping]] such as the [[Weil pairing]] or [[Tate pairing]], generalizations of the [[Diffie–Hellman problem|computational Diffie–Hellman problem]] are believed to be infeasible while the simpler [[decisional Diffie–Hellman assumption|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.

While first used for [[Menezes-Okamato-Vanstone attack|cryptanalysis]],<ref>{{cite journal|last1=Menezes|first1=Alfred J. Menezes|last2=Okamato|first2=Tatsuaki|last3=Vanstone|first3=Scott A.|title=Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field|journal=IEEE Transactions Onon Information Theory|date=1993|volume=39|issue=5}}</ref> 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.

A contemporary example of using bilinear pairings is exemplified in the [[Boneh-Lynn-Shacham]] signature scheme.

Line 42:

[[Category:Elliptic curve cryptography]]

[[Category:Pairing-based cryptography| ]]

{{crypto-stub}}