The group Diffie-Hellman problems

Bresson, E.;Chevassut, O;Pointcheval, D
(2003) 9th Annual International Workshop on Selected Areas in Cryptography — Location: ST JOHNS(Canada) (15.August.2002)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 264.23 KB
Request a copy

Details

Authors
  • Bresson, E.
    Author
  • Chevassut, O
    Author
  • Pointcheval, D
    Author
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Bresson, E., Chevassut, O., & Pointcheval, D. (2003). The group Diffie-Hellman problems. Lecture Notes in Computer Science, 2595, 325-338. https://doi.org/10.1007/3-540-36492-7_21 (Original work published 2003)