Decisional Linear assumption

From Wikipedia, the free encyclopedia

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 ^[1].

Informally the DLIN assumption states that it is hard to decide whether a triple (a,b,c) = (f^x,h^y,g^z) has the property that x + y = z.

[edit] References

1. ^ Dan Boneh, Xavier Boyen, Hovav Shacham: Short Group Signatures. CRYPTO 2004: 41-55

v • d • e   Public-key cryptography Algorithms: CEILIDH | Cramer-Shoup | DH | DSA | ECDH | ECDSA | EKE | ElGamal encryption | ElGamal signature scheme | GMR | IES | Lamport | MQV | NTRUEncrypt | NTRUSign | Paillier | Rabin | RSA | Schnorr | SPEKE | SRP | XTR Theory: Discrete logarithm | Elliptic curve cryptography | RSA problem Standardization: ANS X9F1 | CRYPTREC | IEEE P1363 | NESSIE | NSA Suite B Misc: Digital signature | Fingerprint | PKI | Web of trust | Key size v • d • e   Cryptography History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers | Steganography