Decisional Linear assumption
- Decisional Linear assumption
The Decisional Linear (DLIN) assumption is a mathematic assumption used in elliptic curve cryptography. In particular the DLIN assumption is often used in settings in which the Decisional Diffie-Hellman assumption does not hold, as is often the case in Pairing-based cryptography. The Decisional Linear assumption was introduced by Boneh, Boyen, and Shacham [Dan Boneh, Xavier Boyen, Hovav Shacham: Short Group Signatures. CRYPTO 2004: 41-55] .
Informally the DLIN assumption states that it is hard to decide whether a triple has the property that .
References
Wikimedia Foundation.
2010.
Look at other dictionaries:
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
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. It is used as the basis to prove the security of many cryptographic protocols, most… … Wikipedia
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. It is used as the basis to prove the security of many cryptographic protocols, most… … 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
Naor-Reingold Pseudorandom Function — In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… … Wikipedia
