Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More
复制标题
无回合崩溃的信息论 2 轮 MPC：自适应安全性等
DOI：
10.1007/978-3-030-64378-2_18
复制
发表时间：
2020
影响因子：
3
通讯作者：
H. Wee
中科院分区：
文献类型：
--
作者：
Huijia Lin;Tianren Liu;H. Wee
我们提出了更简单的和改进的结构的2轮协议的安全多方计算（MPC）在半诚实设置。我们的主要结果是新的信息理论安全协议的算术NC 1在两个设置：（i）平原模型容忍高达t < n/ 2的腐败;（ii）在OLE相关模型容忍任何数量的腐败。我们的协议实现了自适应安全性，只需要黑盒访问底层字段，而以前的结果只实现了静态安全性，需要非黑盒字段访问。此外，这两个结果扩展到多项式大小的电路与计算和自适应的安全性，而依赖于黑盒访问的伪随机发生器。在OLE相关模型中，电路的扩展协议最多可以容忍n-1次破坏。沿着的方式，我们介绍了一个概念新颖的框架，2轮MPC，不依赖于轮崩溃框架的基础上的所有最近的进展2轮MPC。
We present simpler and improved constructions of 2-round protocols for secure multi-party computation (MPC) in the semi-honest setting. Our main results are new information-theoretically secure protocols for arithmetic NC1 in two settings: (i) the plain model tolerating up to t < n/ 2 corruptions; and (ii) in the OLE-correlation model tolerating any number of corruptions. Our protocols achieve adaptive security and require only black-box access to the underlying field, whereas previous results only achieve static security and require non-black-box field access. Moreover, both results extend to polynomial-size circuits with computational and adaptive security, while relying on black-box access to a pseudorandom generator. In the OLE correlation model, the extended protocols for circuits tolerate up to n − 1 corruptions. Along the way, we introduce a conceptually novel framework for 2-round MPC that does not rely on the round collapsing framework underlying all of the recent advances in 2-round MPC.
DOI：
10.1007/978-3-319-78375-8_17
发表时间：
2018-04
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Fabrice Benhamouda;Huijia Lin
通讯作者：
Fabrice Benhamouda;Huijia Lin