Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols
Two-Round MPC without Round Collapsing Revisited - Towards Efficient Malicious Protocols
复制标题
DOI：
10.1007/978-3-031-15802-5_13
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
Huijia Lin;Tianren Liu
中科院分区：
文献类型：
--
作者：
Huijia Lin;Tianren Liu
最近的工作取得了令人兴奋的进展，建设轮最佳，两轮，多方计算（MPC）协议。然而，迄今为止，大多数提案仍然复杂而低效。在这项工作中，我们提高了两轮MPC的简单性和效率的设置与不诚实的多数和恶意的安全。我们的协议利用随机预言机（）和不经意线性评价（）相关的随机性，称为张量，在有限域上的推广，并实现以下：MPC布尔电路：我们的两轮，恶意安全MPC协议计算布尔电路，具有整体（渐近）计算成本，其中是计算的电路的大小，n党的数量，和特征2的字段。算法分支程序的MPC：我们的两轮，信息理论上和恶意安全的协议用于计算一般域上的分支程序，具有总的计算成本，其中S是计算的ABP的大小。两个协议都实现了与域的大小成反比的安全级别。我们的构造是建立在[Lin-Liu-Wee TCC'20]的简单两轮MPC协议上的，它只是半诚实安全的。我们的主要技术贡献在于使用简单和轻量级的检查来确保恶意安全性，这只会导致Lin，Liu和Wee协议复杂性的恒定开销。特别是，在计算布尔电路的情况下，我们的恶意MPC协议具有相同的复杂性（恒定的开销）作为（不安全）计算姚的乱码电路在一个分布式的fashion.Finally，作为一个额外的贡献，我们展示了如何有效地生成张量相关的领域的特征二使用OT。
Recent works have made exciting progress on the construction of round optimal,two-round, Multi-Party Computation (MPC) protocols. However, most proposals so far are still complex and inefficient. In this work, we improve the simplicity and efficiency of two-round MPC in the setting with dishonest majority and malicious security. Our protocols make use of the Random Oracle () and a generalization of the Oblivious Linear Evaluation () correlated randomness, called tensor, over a finite field, and achieve the following:MPC for Boolean Circuits:Our two-round, maliciously secure MPC protocols for computing Boolean circuits, has overall (asymptotic) computational cost, whereSis the size of the circuit computed,nthe number of parties, anda field of characteristic two. The protocols also make black-box calls to a Pseudo-Random Function (PRF).MPC for Arithmetic Branching Programs (ABPs):Our two-round, information theoretically and maliciously secure protocols for computing ABPs over a general fieldhas overall computational cost, whereSis the size of ABP computed.Both protocols achieve security levels inverse proportional to the size of the field.Our construction is built upon the simple two-round MPC protocols of [Lin-Liu-Wee TCC’20], which are only semi-honest secure. Our main technical contribution lies in ensuring malicious security using simple and lightweight checks, which incur only a constant overhead over the complexity of the protocols by Lin, Liu, and Wee. In particular, in the case of computing Boolean circuits, our malicious MPC protocols have the same complexity (up to a constant overhead) as (insecurely) computing Yao’s garbled circuits in a distributed fashion.Finally, as an additional contribution, we show how to efficiently generate tensorcorrelation in fields of characteristic two using OT.