Abstract
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.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Cynthia Dwork
Rights and permissions
About this article
Cite this article
Joux, A., Nguyen, K. Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups. J Cryptol 16, 239–247 (2003). https://doi.org/10.1007/s00145-003-0052-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-003-0052-4