随机预言机模型下单轮密钥协商协议的破解
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
摘要：
在本文中，我们研究了一轮密钥协商协议类似于Merkle的困惑在随机预言机模型。允许参与者Alice和Bob查询随机排列oracle $n$次，并且在他们的查询和通信时，他们都以高概率输出相同的密钥。我们证明了夏娃总是可以打破这样的协议，通过查询的oracle $O(n^2)$时间。长期未被证明的最优性的二次界在完全一般的，多轮的情况下，最近已经显示了巴拉克和Mahmoody-Ghibrant。本文中的结果是独立于他们的工作发现的。
英文摘要：
In this paper we study one-round key-agreement protocols analogous to Merkle's puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutation oracle $n$ times and upon their queries and communication, they both output the same key with high probability. We prove that Eve can always break such a protocol by querying the oracle $O(n^2)$ times. The long-time unproven optimality of the quadratic bound in the fully general, multi-round scenario has been shown recently by Barak and Mahmoody-Ghidary. The results in this paper have been found independently of their work.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
