The Group Diffie-Hellman Problems


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 DiffieHellman assumptions not only enable one to construct efficient pseudorandom functions but also to naturally extend the Diffie-Hellman protocol to allow more than… (More)
DOI: 10.1007/3-540-36492-7_21

2 Figures and Tables



Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics