Decisional Diffie-Hellman assumption
GPTKB entity
Statements (20)
Predicate | Object |
---|---|
gptkbp:instanceOf |
cryptographic assumption
|
gptkbp:abbreviation |
gptkb:DDH_assumption
|
gptkbp:appliesTo |
groups of prime order
|
gptkbp:assumes |
no efficient algorithm can distinguish (g, g^a, g^b, g^{ab}) from (g, g^a, g^b, g^c) in a cyclic group
|
gptkbp:describes |
difficulty of distinguishing tuples in a cyclic group
|
gptkbp:field |
cryptography
|
gptkbp:formedBy |
1990s
|
https://www.w3.org/2000/01/rdf-schema#label |
Decisional Diffie-Hellman assumption
|
gptkbp:isWeakerThan |
gptkb:Computational_Diffie-Hellman_assumption
gptkb:Discrete_Logarithm_assumption |
gptkbp:notHoldsIn |
some composite order groups
some elliptic curve groups |
gptkbp:relatedTo |
gptkb:Diffie-Hellman_key_exchange
gptkb:Computational_Diffie-Hellman_assumption |
gptkbp:usedIn |
gptkb:ElGamal_encryption
public-key cryptography key exchange protocols pseudorandom generators |
gptkbp:bfsParent |
gptkb:Cramer-Shoup_cryptosystem
|
gptkbp:bfsLayer |
6
|