Diffie–Hellman problem

Known as: Diffie Hellman problem, Decision Diffie–Hellman problem, Diffie-Hellman protocol 
The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2018
0204019852018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Many cryptographic schemes are based on computationally hard problems. The computational Diffie–Hellman problem is the most well… (More)
Is this relevant?
2011
2011
The Diffie-Hellman key agreement protocol, is a procedure that allows establishing a shared secret over an insecure connection… (More)
  • figure 1
Is this relevant?
Review
2010
Review
2010
This note is an exposition of reductions among the q-strong Diffie-Hellman problem and related problems. 1 The q-Strong Diffie… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We propose a new computational problem called the twin Diffie–Hellman problem. This problem is closely related to the usual… (More)
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Let g be an element of prime order p in an abelian group and α ∈ Zp. We show that if g, g, and g d are given for a positive… (More)
Is this relevant?
2005
2005
This paper considers the Diffie-Hellman problem (DHP) over the matrix group GLn over finite fields and shows that for matrices A… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
We show a signature scheme whose security is tightly related to the Computational Diffie-Hellman (CDH) assumption in the Random… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Ever since a-party Diffie-Hellman key exchange was first proposed in 1976, there have been efforts to extend its simplicity and… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?