Pairing-based cryptography
- Pairing-based cryptography
Pairing-based cryptography is the use of a pairing between elements of two groups to a third group to construct cryptographic systems. Usually the same group is used for the first two groups, making the pairing in fact a mapping from two elements from one group to an element form a second group. In this way, 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 Diffie-Hellman problem are believed to be computationally infeasible while the simpler Decision 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 cryptanalysis, pairings have since been used to construct many cryptographic systems for which no other efficient implementation is known, such as identity based encryption .
External links
* [http://theory.lcs.mit.edu/classes/6.897/spring04/L25.pdf Lecture on Pairing-Based Cryptography]
* [http://planeta.terra.com.br/informatica/paulobarreto/pblounge.html The Pairing-Based Crypto Lounge]
Wikimedia Foundation.
2010.
Look at other dictionaries:
ID-based cryptography — Identity based cryptography is a type of public key cryptography in which a publicly known string representing an individual or organization is used as a public key. The public string could include an email address, domain name, or a physical IP… … Wikipedia
Pairing — The concept of pairing treated here occurs in mathematics. Definition Let R be a commutative ring with unity, and let M , N and L be three R modules. A pairing is any R bilinear map e:M imes N o L. That is, it satisfies:e(rm,n)=e(m,rn)=re(m,n)for … Wikipedia
Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… … Wikipedia
Weil pairing — In mathematics, the Weil pairing is a construction of roots of unity by means of functions on an elliptic curve E , in such a way as to constitute a pairing (bilinear form, though with multiplicative notation) on the torsion subgroup of E . The… … Wikipedia
Dan Boneh — Born Israel … Wikipedia
Paulo S. L. M. Barreto — Infobox Person image size = 150px name = Paulo S. L. M. Barreto caption = birth date = residence = flagicon|Brazil São Paulo known for = Cryptographic hash functions, Pairing based cryptography occupation = Professor, University of São Paulo… … Wikipedia
Non-interactive zero-knowledge proof — Non interactive zero knowledge proofs are a variant of zero knowledge proofs. Blum, Feldman, and Micali [1] showed that a common reference string shared between the prover and the verifier is enough to achieve computational zero knowledge without … Wikipedia
Nigel Smart (cryptographer) — Nigel Smart is a professor in the Department of Computer Science at the University of Bristol and a current holder of the Royal Society Wolfson Research Merit Award. He is best known for his work in Elliptic curve cryptography, especially work on … Wikipedia
Victor S. Miller — (b. 3 March, 1947 in Brooklyn, New York, USA) is an American mathematician at the Center for Communications Research of the Institute for Defense Analyses in Princeton, NJ, USA. He received his A.B. in mathematics from Columbia University in 1968 … Wikipedia
Decision Linear assumption — The Decision Linear (DLIN) assumption is a mathematical assumption used in elliptic curve cryptography. In particular, the DLIN assumption is useful in settings where the decisional Diffie–Hellman assumption does not hold (as is often the case in … Wikipedia
