%0 Conference Paper %1 DBLP:conf/crypto/BarakM09 %A Barak, Boaz %A Mahmoody-Ghidary, Mohammad %B CRYPTO %D 2009 %E Halevi, Shai %I Springer %K crypto merkel reduction %P 374-390 %R 10.1007/978-3-642-03356-8_22 %T Merkle Puzzles Are Optimal - An ($^2$)-Query Attack on Any Key Exchange from a Random Oracle %V 5677 %X 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 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 2) queries. %@ 978-3-642-03355-1

@inproceedings{DBLP:conf/crypto/BarakM09, 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 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 2) queries.}, added-at = {2010-03-27T01:57:15.000+0100}, author = {Barak, Boaz and Mahmoody-Ghidary, Mohammad}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/24d0d556862fedd23c8bf9c37d7f5afb8/ytyoun}, booktitle = {CRYPTO}, crossref = {DBLP:conf/crypto/2009}, doi = {10.1007/978-3-642-03356-8_22}, editor = {Halevi, Shai}, interhash = {f4a97cdfb7da16af4622d7ccf5e59bed}, intrahash = {4d0d556862fedd23c8bf9c37d7f5afb8}, isbn = {978-3-642-03355-1}, keywords = {crypto merkel reduction}, pages = {374-390}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2016-06-14T14:07:34.000+0200}, title = {Merkle Puzzles Are Optimal - An {\it }({\it }$^{\mbox{2}}$)-Query Attack on Any Key Exchange from a Random Oracle}, volume = 5677, year = 2009 }