Abstract

The Decision Diffie-Hellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area. 1 Introduction An important goal of cryptography is to pin down the exact complexity assumptions used by cryptographic protocols. Consider the Diffie-Hellman key exchange protocol [12]: Alice and Bob fix a finite cyclic group G and a generator g. They respectively pick random a; b 2 [1; jGj] and exchange g a ; g b . The secret key is g ab . To totally break the protocol a passive eavesdropper, Eve, must compute the Diffie-Hellman function defined as: dh g (g a ; g b ) = g ab . We say that the group G satisfies the Computational Diffie-Hellman assumption (cdh) if no efficient algorithm can compute the function dh g (x; y) in G. Precise definitions are given in the next sectio...

Citations

2548	New Directions in Cryptography - Diffie, Hellman - 1976
1111	Probabilistic encryption - Goldwasser, Micali - 1984
693	Pseudo-random generation from one-way functions - Impagliazzo, Levin, et al. - 1989
659	Factoring polynomials with rational coefficients - Lenstra, Jr, et al. - 1982
602	How to construct random functions - Goldreich, Goldwasser, et al. - 1986
463	Group signatures - Chaum, Heyst - 1991
441	A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack - Cramer, Shoup - 1998
440	Nonmalleable cryptography - Dolev, Dwork, et al.
235	M.: Public-key cryptosystems provably secure against chosen ciphertext attacks - Naor, Yung - 1990
137	Number-theoretic constructions of efficient pseudorandom functions - NAOR, REINGOLD - 1997
127	An Efficient Off-line Electronic Cash System Based on the Representation Problem - Brands - 1993
101	Towards realizing random oracles: Hash functions that hide all partial information - Canetti - 1997
95	Non-interactive oblivious transfer and applications - Bellare, Micali - 1989
91	Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes - Boneh, Venkatesan - 1996
71	Algorithms for black-box fields and their application to cryptography - Boneh, Lipton - 1996
65	Complexity of a determinate algorithm for the discrete logarithm - Nechaev - 1994
62	Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known - Coppersmith - 1996
48	On the Cryptographic Applications of Random Functions - Goldreich, Goldwasser, et al. - 1985
41	New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs - Bellare, Goldwasser - 1990
41	Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions - Naor, Reingold - 1995
33	Diffie-Hellman Oracles - Maurer, Wolf - 1996
26	On certain exponential sums and the distribution of Diffie-Hellman triples - Canetti, Friedlander, et al. - 1999
19	A Course in Computational Number Theory - COHEN
15	Lower bounds on generic algorithms in groups - Maurer, Wolf - 1998
4	Towards proving the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms - Maurer - 1994
1	Hard core bits based on any one way function - Goldreich, Levin