The Hardness of the DHK Problem in the Generic Group Model

@article{Dent2006TheHO,
  title={The Hardness of the DHK Problem in the Generic Group Model},
  author={Alexander W. Dent},
  journal={IACR Cryptology ePrint Archive},
  year={2006},
  volume={2006},
  pages={156}
}
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 DiffieHellman Knowledge problem is true or false, although a similar result was developed independently and in parallel by Abe and Fehr [1]. 1 The Generic Group Model It is clear that the way in which we represent a group to a polynomial-time algorithm affects the computational power of that algorithm… CONTINUE READING
30 Citations
18 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Perfect NIZK with adaptive security

  • M. Abe, S. Fehr
  • Unpublished manuscript,
  • 2006
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…