Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,258,701 papers from all fields of science
Search
Sign In
Create Free Account
Diffie–Hellman key exchange
Known as:
DH key exchange
, DHMKE
, D-H Key Exchange
Expand
Diffie–Hellman key exchange (D–H) is a specific method of securely exchanging cryptographic keys over a public channel and was one of the first…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Alice and Bob
Apple Open Directory
Authentication
Cipher
Expand
Broader (1)
Public-key cryptography
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
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
M. P. Rewagad
,
Hod
,
Ms.Yogita Pawar
,
M. E. Student
International Conference on Communication Systems…
2013
Corpus ID: 25634473
Cloud computing is the apt technology for the decade. It allows user to store large amount of data in cloud storage and use as…
Expand
Highly Cited
2007
Highly Cited
2007
Provably secure authenticated group Diffie-Hellman key exchange
E. Bresson
,
O. Chevassut
,
D. Pointcheval
TSEC
2007
Corpus ID: 388535
Authenticated key-exchange protocols allow two participants A and B, communicating over a public network and each holding an…
Expand
2006
2006
A Diffie-Hellman Key Exchange Protocol Without Random Oracles
I. Jeong
,
J. Kwon
,
Dong Hoon Lee
Cryptology and Network Security
2006
Corpus ID: 10076296
The MQV protocol of Law, Menezes, Qu, Slinas and Vanstone has been regarded as the most efficient authenticated Diffie-Hellman…
Expand
2005
2005
N-Party Encrypted Diffie-Hellman Key Exchange Using Different Passwords
J. Byun
,
Dong Hoon Lee
International Conference on Applied Cryptography…
2005
Corpus ID: 17113206
We consider the problem of password-authenticated group Diffie-Hellman key exchange among N parties, N–1 clients and a single…
Expand
2005
2005
Weaknesses in two group Diffie-Hellman key exchange protocols
Qiang Tang
,
Liqun Chen
IACR Cryptology ePrint Archive
2005
Corpus ID: 8450813
In this paper we show that the password-based Diffie-Hellman key exchange protocols due to Byun and Lee suffer from dictionary…
Expand
Review
2005
Review
2005
Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups
A. Mahalanobis
IACR Cryptology ePrint Archive
2005
Corpus ID: 5835865
This dissertation has two chapters. In the first chapter we talk about the discrete logarithm problem, more specifically we…
Expand
Highly Cited
2004
Highly Cited
2004
Integrating Diffie-Hellman key exchange into the digital signature algorithm (DSA)
L. Harn
,
M. Mehta
,
Wen-Jung Hsin
IEEE Communications Letters
2004
Corpus ID: 15827334
The National Institute of Standards and Technology (NIST) has published a series of security standards under Federal Information…
Expand
Highly Cited
2003
Highly Cited
2003
More Modular Exponential (MODP) Diffie-Hellman groups for Internet Key Exchange (IKE)
T. Kivinen
,
Mika Kojo
Request for Comments
2003
Corpus ID: 32372582
This document defines new Modular Exponential (MODP) Groups for the Internet Key Exchange (IKE) protocol. It documents the well…
Expand
Highly Cited
2002
Highly Cited
2002
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
E. Bresson
,
O. Chevassut
,
D. Pointcheval
International Conference on the Theory and…
2002
Corpus ID: 2216950
Authenticated Die-Hellman key exchange allows two prin- cipals communicating over a public network, and each holding pub- lic…
Expand
Highly Cited
1996
Highly Cited
1996
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
D. Boneh
,
R. Venkatesan
Annual International Cryptology Conference
1996
Corpus ID: 18810053
We show that computing the most significant bits of the secret key in a Diffie-Hellman key-exchange protocol from the public keys…
Expand
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)
ACCEPT & CONTINUE