The Diffie–Hellman Protocol

Authors:
Ueli M. Maurer;Stefan Wolf
Affiliations:
Computer Science Department, Swiss Federal Institute of Technology (ETH Zürich), CH-8092 Zürich, Switzerland;Computer Science Department, Swiss Federal Institute of Technology (ETH Zürich), CH-8092 Zürich, Switzerland
Venue:
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Year:
2000

Citing 26
Cited 19

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Almost all primes can be quickly certified

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple and fast probabilistic algorithm for computing square roots modulo a prime number

IEEE Transactions on Information Theory
On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica
Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A key distribution system equivalent to factoring

Journal of Cryptology
A key-exchange system based on imaginary quadratic fields

Journal of Cryptology
Hyperelliptic cryptosystems

Journal of Cryptology
Computing the number of points of elliptic curves over finite fields

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Algorithms for computer algebra

Algorithms for computer algebra
A Non-interactive Public-Key Distribution System

Designs, Codes and Cryptography
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
Diffie-Hillman is as Strong as Discrete Log for Certain Primes

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
The Probability Distribution of the Diffie-Hellman Key

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Constructing elliptic curves with given group order over large finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
An Efficient Off-line Electronic Cash System Based On The Representation Problem.

An Efficient Off-line Electronic Cash System Based On The Representation Problem.
Studies in computational number theory with applications to cryptography

Studies in computational number theory with applications to cryptography
On diffie-hellman key agreement with short exponents

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Relationships among the computational powers of breaking discrete log cryptosystems

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Elliptic curve cryptosystems using curves of smooth order over the ring Zn

IEEE Transactions on Information Theory

Delegation of cryptographic servers for capture-resilient devices

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Grammar based off line generation of disposable credit card numbers

Proceedings of the 2002 ACM symposium on Applied computing
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
On Sufficient Randomness for Secure Public-Key Cryptosystems

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficiency improvements for signature schemes with tight security reductions

Proceedings of the 10th ACM conference on Computer and communications security
On the complexity of the discrete logarithm and Diffie-Hellman problems

Journal of Complexity - Special issue on coding and cryptography
Delegation of cryptographic servers for capture-resilient devices

Distributed Computing
Tree-based group key agreement framework for mobile ad-hoc networks

Future Generation Computer Systems
Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem

SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
The Diffie---Hellman problem and generalization of Verheul's theorem

Designs, Codes and Cryptography
Key agreement for heterogeneous mobile ad-hoc groups

International Journal of Wireless and Mobile Computing
Interpolation of the elliptic curve Diffie-Hellman mapping

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem

IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Password authenticated key exchange for resource-constrained wireless communications (extended abstract)

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Polynomial approximation of bilinear Diffie--Hellman maps

Finite Fields and Their Applications
On pairing inversion problems

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The1976 seminal paper of Diffie and Hellman is a landmark in thehistory of cryptography. They introduced the fundamental conceptsof a trapdoor one-way function, a public-key cryptosystem, anda digital signature scheme. Moreover, they presented a protocol,the so-called Diffie–Hellman protocol, allowing two partieswho share no secret information initially, to generate a mutualsecret key. This paper summarizes the present knowledge on thesecurity of this protocol.