The Hardness of the DHK Problem in the Generic Group Model

Alexander W.  Dent

Paper 2006/156

The Hardness of the DHK Problem in the Generic Group Model

Alexander W. Dent

Abstract

In this note we prove that the controversial Diffie-Hellman Knowledge problem is secure in the generic group model. This appears to be the first paper that presents any evidence as to whether the Diffie-Hellman Knowledge problem is true or false.

Metadata

Available format(s): PDF PS
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): a dent @ rhul ac uk
History: 2006-05-09: revised; 2006-04-24: received; See all versions
Short URL: https://ia.cr/2006/156
License: CC BY

BibTeX

@misc{cryptoeprint:2006/156,
      author = {Alexander W.  Dent},
      title = {The Hardness of the DHK Problem in the Generic Group Model},
      howpublished = {Cryptology ePrint Archive, Paper 2006/156},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/156}},
      url = {https://eprint.iacr.org/2006/156}
}