Faster access than browser!
16 relations: Attribute-based encryption, Bilinear map, Boneh–Lynn–Shacham, Cryptosystem, Decisional Diffie–Hellman assumption, Degeneracy (mathematics), Diffie–Hellman problem, Elliptic-curve cryptography, Group (mathematics), Homomorphism, ID-based encryption, Map (mathematics), Pairing, Supersingular elliptic curve, Tate pairing, Weil pairing.
Attribute-based encryption
Attribute-based encryption is a type of public-key encryption in which the secret key of a user and the ciphertext are dependent upon attributes (e.g. the country in which he lives, or the kind of subscription he has).
New!!: Pairing-based cryptography and Attribute-based encryption · See more »
Bilinear map
In mathematics, a bilinear map is a function combining elements of two vector spaces to yield an element of a third vector space, and is linear in each of its arguments.
New!!: Pairing-based cryptography and Bilinear map · See more »
Boneh–Lynn–Shacham
In cryptography, the Boneh–Lynn–Shacham (BLS) signature scheme allows a user to verify that a signer is authentic.
New!!: Pairing-based cryptography and Boneh–Lynn–Shacham · See more »
Cryptosystem
In cryptography, a cryptosystem is a suite of cryptographic algorithms needed to implement a particular security service, most commonly for achieving confidentiality (encryption).
New!!: Pairing-based cryptography and Cryptosystem · See more »
Decisional Diffie–Hellman assumption
The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic groups.
New!!: Pairing-based cryptography and Decisional Diffie–Hellman assumption · See more »
Degeneracy (mathematics)
In mathematics, a degenerate case is a limiting case in which an element of a class of objects is qualitatively different from the rest of the class and hence belongs to another, usually simpler, class.
New!!: Pairing-based cryptography and Degeneracy (mathematics) · See more »
Diffie–Hellman problem
The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography.
New!!: Pairing-based cryptography and Diffie–Hellman problem · See more »
Elliptic-curve cryptography
Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.
New!!: Pairing-based cryptography and Elliptic-curve cryptography · See more »
Group (mathematics)
In mathematics, a group is an algebraic structure consisting of a set of elements equipped with an operation that combines any two elements to form a third element and that satisfies four conditions called the group axioms, namely closure, associativity, identity and invertibility.
New!!: Pairing-based cryptography and Group (mathematics) · See more »
Homomorphism
In algebra, a homomorphism is a structure-preserving map between two algebraic structures of the same type (such as two groups, two rings, or two vector spaces).
New!!: Pairing-based cryptography and Homomorphism · See more »
ID-based encryption
ID-based encryption, or identity-based encryption (IBE), is an important primitive of ID-based cryptography.
New!!: Pairing-based cryptography and ID-based encryption · See more »
Map (mathematics)
In mathematics, the term mapping, sometimes shortened to map, refers to either a function, often with some sort of special structure, or a morphism in category theory, which generalizes the idea of a function.
New!!: Pairing-based cryptography and Map (mathematics) · See more »
Pairing
In mathematics, a pairing is an R-bilinear map of modules, where R is the underlying ring.
New!!: Pairing-based cryptography and Pairing · See more »
Supersingular elliptic curve
In algebraic geometry, supersingular elliptic curves form a certain class of elliptic curves over a field of characteristic p > 0 with unusually large endomorphism rings.
New!!: Pairing-based cryptography and Supersingular elliptic curve · See more »
Tate pairing
In mathematics, Tate pairing is any of several closely related bilinear pairings involving elliptic curves or abelian varieties, usually over local or finite fields, based on the Tate duality pairings introduced by and extended by.
New!!: Pairing-based cryptography and Tate pairing · See more »
Weil pairing
In mathematics, the Weil pairing is a pairing (bilinear form, though with multiplicative notation) on the points of order dividing n of an elliptic curve E, taking values in nth roots of unity.
New!!: Pairing-based cryptography and Weil pairing · See more »
References
[1] https://en.wikipedia.org/wiki/Pairing-based_cryptography
