Skip to search formSkip to main contentSkip to account menu

Decisional Diffie–Hellman assumption

Known as: Decision Diffie-Hellman problem, Decisional Diffie-Hellman assumption, DDH assumption 
The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
Computational Diffie–Hellman assumptionComputational hardness assumptionCryptographically secure pseudorandom number generatorCryptography

Broader (1)

Elliptic curve cryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
The Kernel Matrix Diffie-Hellman Assumption
We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix… 
Highly Cited
2008
Highly Cited
2008
The Twin Diffie-Hellman Problem and Applications
We propose a new computational problem called the twin Diffie-Hellman problem. This problem is closely related to the usual… 
Highly Cited
2008
Highly Cited
2008
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [13] showed a variant of the Cramer-Shoup (CS) scheme [14] whose chosen-ciphertext (CCA) security… 
2006
2006
A Note on Chosen-Basis Decisional Diffie-Hellman Assumptions
This note discusses two Decisional Diffie-Hellman assumption variants introduced by Abdalla and Pointcheval at Financial… 
2005
2005
Decisional Diffie-Hellman Assumption
  • R. Canetti
  • Encyclopedia of Cryptography and Security
  • 2005
  • Corpus ID: 34723508
Highly Cited
2004
Highly Cited
2004
Secure Hashed Diffie-Hellman over Non-DDH Groups
The Diffie-Hellman (DH) transform is a basic cryptographic primitive used in innumerable cryptographic applications, most… 
Highly Cited
2004
Highly Cited
2004
Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the Diffie-Hellman problem in Gap… 
Highly Cited
1999
Highly Cited
1999
DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem
This paper describes a Di(cid:14)e-Hellman based encryption scheme, DHAES. The scheme is as e(cid:14)cient as ElGamal encryption… 
Highly Cited
1992
Highly Cited
1992
Perceptual and decisional separability.
Highly Cited
1991
Highly Cited
1991
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)