Merkle’s Key Agreement Protocol is Optimal: An O(n^2) Attack on Any Key Agreement from Random Oracles
J. Cryptol.(2016)
摘要
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^2) queries to the oracle. This improves on the previous Ω̃(n^6) query attack given by Impagliazzo and Rudich (STOC ’89) and resolves an open question posed by them. Our bound is optimal up to a constant factor since Merkle proposed a key agreement protocol in 1974 that can be easily implemented with n queries to a random oracle and cannot be broken by any adversary who asks o(n^2) queries.
更多查看译文
关键词
Key agreement,Random oracle,Merkle puzzles
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络