Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification
Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification
复制标题
DOI：
10.1007/978-3-319-93387-0_17
复制
发表时间：
2018-07
期刊：
影响因子：
--
通讯作者：
P. S. Nordholt;Meilof Veeningen
中科院分区：
文献类型：
--
作者：
P. S. Nordholt;Meilof Veeningen
在这篇文章中，我们提出了两个新的和非常有效的通信效率的协议，用于在诚实多数设置和中止的域上的恶意安全多方计算。我们的第一个协议改进了Lindell和Nof最近的一个协议。利用迄今被忽视的分批乘法验证工具，我们加快了他们的乘法正确性检查技术(还有其他一些改进)，将通信量减少了4%。具体地，在3PC设置中，每一方每次乘法仅发送两个域元素。我们还展示了如何实现公平，这是Lindell和Nof作为一个公开问题留下的。我们的第二个协议再次应用分批乘法验证，这一次通过让双方使用由第三方生成的三元组执行SPDZ协议来执行3PC，并进行分批验证。在该协议中，每一方在在线阶段仅发送field元素，在预处理阶段仅发送field元素。
In this paper, we present two new and very communication-efficient protocols for maliciously secure multi-party computation over fields in the honest-majority setting with abort. Our first protocol improves a recent protocol by Lindell and Nof. Using the so far overlooked tool of batchwise multiplication verification, we speed up their technique for checking correctness of multiplications (with some other improvements), reducing communication byto. In particular, in the 3PC setting, each party sends only two field elements per multiplication. We also show how to achieve fairness, which Lindell and Nof left as an open problem. Our second protocol again applies batchwise multiplication verification, this time to perform 3PC by letting two parties perform the SPDZ protocol using triples generated by a third party and verified batchwise. In this protocol, each party sends onlyfield elements during the online phase andfield elements during the preprocessing phase.