Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Computational Diffie–Hellman assumptionCryptographyDecisional Diffie–Hellman assumptionDiffie–Hellman key exchange

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Identity-Based Encryption from the Diffie-Hellman Assumption
We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness… 
Highly Cited
2013
Highly Cited
2013
Use of Digital Signature with Diffie Hellman Key Exchange and AES Encryption Algorithm to Enhance Data Security in Cloud Computing
Cloud computing is the apt technology for the decade. It allows user to store large amount of data in cloud storage and use as… 
Highly Cited
2009
Highly Cited
2009
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique… 
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
2005
Highly Cited
2005
Interactive Diffie-Hellman Assumptions with Applications to Password-Based Authentication
Password-based authenticated key exchange are protocols that are designed to provide strong authentication for client-server… 
2004
2004
Short Exponent Diffie-Hellman Problems
In this paper, we study short exponent Diffie-Hellman problems, where significantly many lower bits are zeros in the exponent. We… 
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
2004
Highly Cited
2004
Easy decision-Diffie-Hellman groups
The decision Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate… 
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
1999
Highly Cited
1999
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Both uniform and nonuniform results concerning the security of the Diffie--Hellman key-exchange protocol are proved. First, it is… 
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)