Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
نویسندگان
چکیده
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) queries to the oracle. This improves on the previous Ω̃(n) query attack given by Impagliazzo and Rudich (STOC ’89), and answers an open question posed by them. Our bound is optimal up to a constant factor since Merkle (CACM ’78) gave a key exchange protocol that can easily be implemented in this model with n queries and cannot be broken by an adversary making o(n) queries.
منابع مشابه
Merkle Puzzles are Optimal — an O(n)-query attack on key exchange from a random oracle
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) queries to the oracle. This improves on the previous Ω̃(n) 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 i...
متن کاملMerkle Puzzles are Optimal
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) queries to the oracle. This improves on the previous Ω̃(n) 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 i...
متن کامل3 Ja n 20 08 Merkle Puzzles are Optimal
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) queries to the oracle. This improves on the previous Ω̃(n) 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 i...
متن کاملMerkle’s Key Agreement Protocol is Optimal: An O(n) Attack on any Key Agreement from Random Oracles
We prove that every key agreement 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 who makes O(n) queries to the oracle. This improves on the previous Ω̃(n) query attack given by Impagliazzo and Rudich (STOC ’89) and resolve an open question posed by them. Our bound is optimal up to a constant factor since Merkle pro...
متن کاملOn the Communication Complexity of Key-Agreement Protocols
Key-agreement protocols whose security is proven in the random oracle model are an important alternative to the more common public-key based key-agreement protocols. In the random oracle model, the parties and the eavesdropper have access to a shared random function (an “oracle”), but they are limited in the number of queries they can make to it. Unfortunately, as shown by Impagliazzo and Rudic...
متن کامل