CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Merkle Puzzles are Optimal

by: Boaz Barak, Mohammad Mahmoody-Ghidary
(23 Jan 2008)

X Abstract

We prove that every key exchange protocol in the random oracle model in which the honest users make at most n queries to the oracle can be broken by an adversary making O(n^2) queries to the oracle. This improves on the previous Omega(n^6) query attack given by Impagliazzo and Rudich (STOC '89). Our bound is optimal up to a constant factor since Merkle (CACM '78) gave an n query key exchange protocol in this model that cannot be broken by an adversary making o(n^2) queries.

View the full article here:

Cryptology ePrint Archive

This article has been bookmarked once, on 2008-08-16.

2008-08-16 User zooko
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.