Round-Optimal Black-Box Two-Party Computation
Round-Optimal Black-Box Two-Party Computation
复制标题
轮优化黑盒两方计算
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Alessandra Scafuro
中科院分区：
文献类型：
--
作者：
R. Ostrovsky;Silas Richelson;Alessandra Scafuro
在[Eurocrypt 2004]中，Katz和Ostrovsky建立了针对黑盒的安全性证据的确切圆形复杂性一个方接收输出），并提供与这样的下限匹配的协议。当考虑到针对恶意对手的安全性 - 在四轮目标中，他们采用了特定的证据，在该目标中，该声明可以在最后一轮中被指定，但这需要非黑色盒子访问基础原始人。
In [Eurocrypt 2004] Katz and Ostrovsky establish the exact round complexity of secure two-party computation with respect to black-box proofs of security. They prove that 5 rounds are necessary for secure two-party protocols (4-round are sufficient if only one party receives the output) and provide a protocol that matches such lower bound. The main challenge when designing such protocol is to parallelize the proofs of consistency provided by both parties – necessary when security against malicious adversaries is considered– in 4 rounds. Toward this goal they employ specific proofs in which the statement can be unspecified till the last round but that require non-black-box access to the underlying primitives.