Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups

@article{Joux2003SeparatingDD,
  title={Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups},
  author={Antoine Joux and Kim Nguyen},
  journal={Journal of Cryptology},
  year={2003},
  volume={16},
  pages={239-247}
}
In many cases the security of a cryptographic scheme based on computational Diffie–Hellman does in fact rely on the hardness of the decision Diffie–Hellman problem. In this paper we construct concrete examples of groups where the stronger hypothesis, hardness of the decision Diffie–Hellman problem, no longer holds, while the weaker hypothesis, hardness of computational Diffie–Hellman, is equivalent to the hardness of the discrete logarithm problem and still seems to be a reasonable hypothesis. 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
92 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 92 extracted citations

Similar Papers

Loading similar papers…