Variations of Diffie-Hellman problem
Conference Proceeding Article
This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and divisible Diffie-Hellman problem, are equivalent with optimal reduction. Also, we are considering variations of the decisional Diffie-Hellman problem in single sample and polynomial samples settings, and we are able to show that all variations are equivalent except for the argument DDH ⇐ SDDH. We are not able to prove or disprove this statement, thus leave an interesting open problem. Keywords: Diffie-Hellman problem, Square Diffie-Hellman problem, Inverse Diffie-Hellman problem, Divisible Diffie-Hellman problem
Intelligent Systems and Decision Analytics
Information and Communications Security: 5th International Conference, ICICS 2003, Huhehaote, China, October 10-13
City or Country
BAO, Feng; DENG, Robert H.; and ZHU, Huafei.
Variations of Diffie-Hellman problem. (2003). Information and Communications Security: 5th International Conference, ICICS 2003, Huhehaote, China, October 10-13. 2836, 301-312. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1083