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 pairing-based cryptography). The Decision Linear assumption was introduced by Boneh, Boyen, and Shacham ^[1].

Informally the DLIN assumption states that given $(f, \, g, \, f^x, \, g^y)$ , with $f, \, g$ random group elements and $x, \, y$ random exponents, it is hard to distinguish $(h, \, h^{x%2By})$ (for random $h$ ) from $(h, \, h')$ (for independently random $h, \, h'$ ).

References

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

Public-key cryptography

Algorithms	Benaloh · Blum–Goldwasser · Cayley–Purser · CEILIDH · Cramer–Shoup · Damgård–Jurik · DH · DSA · EPOC · ECDH · ECDSA · EKE · ElGamal (encryption · signature scheme) · GMR · Goldwasser–Micali · HFE · IES · Lamport · McEliece · Merkle–Hellman · MQV · Naccache–Stern · NTRUEncrypt · NTRUSign · Paillier · Rabin · RSA · Okamoto–Uchiyama · Schnorr · Schmidt–Samoa · SPEKE · SRP · STS · Three-pass protocol · XTR

Theory	Discrete logarithm · Elliptic curve cryptography · RSA problem

Standardization	ANS X9F1 · CRYPTREC · IEEE P1363 · NESSIE · NSA Suite B

Topics	Digital signature · OAEP · Fingerprint · PKI · Web of trust · Key size

Cryptography

History of cryptography · Cryptanalysis · Cryptography portal · Outline of cryptography

Symmetric-key algorithm · Block cipher · Stream cipher · Public-key cryptography · Cryptographic hash function · Message authentication code · Random numbers · Steganography