Variations of diffie-hellman problem (2003)
| Venue: | In ICICS ’03, volume 2836 of LNCS |
| Citations: | 22 - 1 self |
BibTeX
@INPROCEEDINGS{Bao03variationsof,
author = {Feng Bao and Robert H. Deng and Huafei Zhu},
title = {Variations of diffie-hellman problem},
booktitle = {In ICICS ’03, volume 2836 of LNCS},
year = {2003},
pages = {301--312},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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
