The group Diffie-Hellman problems

被引:0
|
作者
Bresson, E
Chevassut, O
Pointcheval, D
机构
[1] Ecole Normale Super, F-75230 Paris 05, France
[2] Lawrence Berkeley Natl Lab, Berkeley, CA 94720 USA
[3] Catholic Univ Louvain, B-31348 Louvain, Belgium
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we study generalizations of the Diffie-Hellman problems recently used to construct cryptographic schemes for practical purposes. The Group Computational and the Group Decisional Diffie-Hellman assumptions not only enable one to construct efficient pseudorandom functions but also to naturally extend the Diffie-Hellman protocol to allow more than two parties to agree on a secret key. In this paper we provide results that add to our confidence in the GCDH problem. We reach this aim by showing exact relations among the GCDH, GDDH, CDH and DDH problems.
引用
收藏
页码:325 / 338
页数:14
相关论文
共 50 条
  • [1] The performance of group Diffie-Hellman paradigms
    Hagzan, KS
    Bischof, HP
    ICWN'04 & PCC'04, VOLS, 1 AND 2, PROCEEDINGS, 2004, : 88 - 94
  • [2] Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms
    Maurer, U
    Wolf, S
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 327 - 327
  • [3] Short exponent Diffie-Hellman problems
    Koshiba, T
    Kurosawa, K
    PUBLIC KEY CRYPTOGRAPHY - PKC 2004, PROCEEDINGS, 2004, 2947 : 173 - 186
  • [4] Diffie-Hellman to the rescue
    Tate, A
    DR DOBBS JOURNAL, 2001, 26 (06): : 12 - 12
  • [5] On the complexity of the discrete logarithm and Diffie-Hellman problems
    Blake, IF
    Garefalakis, T
    JOURNAL OF COMPLEXITY, 2004, 20 (2-3) : 148 - 170
  • [6] The Diffie-Hellman protocol
    Maurer, UM
    Wolf, S
    DESIGNS CODES AND CRYPTOGRAPHY, 2000, 19 (2-3) : 147 - 171
  • [7] Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
    Joux, A
    Nguyen, K
    JOURNAL OF CRYPTOLOGY, 2003, 16 (04) : 239 - 247
  • [8] On the index of the Diffie-Hellman mapping
    Isik, Leyla
    Winterhof, Arne
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2022, 33 (05) : 587 - 595
  • [9] Comparison of the complexity of Diffie-Hellman and discrete logarithm problems
    Cherepniov, Mikhail
    JOURNAL OF COMPUTER VIROLOGY AND HACKING TECHNIQUES, 2020, 16 (04) : 265 - 268
  • [10] Efficient group Diffie-Hellman key agreement protocols
    Harn, Lein
    Lin, Changlu
    COMPUTERS & ELECTRICAL ENGINEERING, 2014, 40 (06) : 1972 - 1980