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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
05019732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix A… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
1Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China 2School of Information… (More)
  • table I
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Let E be a public-key encryption system and let (pki, ski) be public/private key pairs for E for i = 0, . . . , n. A natural… (More)
Is this relevant?
2006
2006
This note discusses two Decisional Diffie-Hellman assumption variants introduced by Abdalla and Pointcheval at Financial… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The decision-Diffie-Hellman problem (DDH) is an important computational problem in cryptography. It is known that the Weil and… (More)
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the Diffie-Hellman problem in Gap… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In many cases the security of a cryptographic scheme based on computational Diffie–Hellman does in fact rely on the hardness of… (More)
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper studies various computational and decisional DiffieHellman problems by providing reductions among them in the high… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we propose an identity(ID)-based signature scheme using gap Diffie-Hellman (GDH) groups. Our scheme is proved… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Authenticated Diffie-Hellman key exchange allows two principals communicating over a public network, and each holding public… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?