Two-Round MPC: Information-Theoretic and Black-Box
Two-Round MPC: Information-Theoretic and Black-Box
复制标题
两轮 MPC：信息论和黑盒
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Akshayaram Srinivasan
中科院分区：
文献类型：
--
作者：
Sanjam Garg;Yuval Ishai;Akshayaram Srinivasan
我们继续研究只需要两轮交互的安全多方计算（MPC）协议。Garg和Srinivasan （Eurocrypt 2018）以及Benhamouda和Lin （Eurocrypt 2018）最近的研究基本上解决了这个问题，他们表明，这种协议是由存在两轮无关转移（OT）协议的最小假设所隐含的。然而，这些协议本质上是非黑盒地使用底层OT协议，这导致了较差的具体效率。此外，在信息论设置中没有已知的类似结果，或者基于单向函数，给定OT相关性设置或诚实多数。
We continue the study of protocols for secure multiparty computation (MPC) that require only two rounds of interaction. The recent works of Garg and Srinivasan (Eurocrypt 2018) and Benhamouda and Lin (Eurocrypt 2018) essentially settle the question by showing that such protocols are implied by the minimal assumption that a two-round oblivious transfer (OT) protocol exists. However, these protocols inherently make a non-black-box use of the underlying OT protocol, which results in poor concrete efficiency. Moreover, no analogous result was known in the information-theoretic setting, or alternatively based on one-way functions, given an OT correlations setup or an honest majority.
DOI：
10.1007/978-3-319-78375-8_17
发表时间：
2018-04
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Fabrice Benhamouda;Huijia Lin
通讯作者：
Fabrice Benhamouda;Huijia Lin