In this work, we present novel protocols over rings for semi-honest secure three-party computation (3-PC) and malicious four-party computation (4-PC) with one corruption. Compared to state-of-the-art protocols in the same setting, our protocols require fewer low-latency and high-bandwidth links between the parties to achieve high throughput. Our protocols also reduce the computational complexity by requiring up to 50 percent fewer basic instructions per gate. Further, our protocols achieve the currently best-known communication complexity (3/5 elements per multiplication gate) with an optional preprocessing phase to reduce the communication complexity of the online phase to 2/3 elements per multiplication gate. In homogeneous network settings, i.e. all links between the parties share similar network bandwidth and latency, our protocols achieve up to two times higher throughput than state-of-the-art protocols. In heterogeneous network settings, i.e. all links between the parties share different network bandwidth and latency, our protocols achieve even larger performance improvements. We implemented our protocols and multiple other state-of-the-art protocols in a novel open-source C++ framework optimized for achieving high throughput. All our protocols achieve more than one billion 32-bit multiplication or more than 40 billion AND gates per second. This is the highest throughput achieved in 3-PC and 4-PC so far and more than three orders of magnitude higher than the throughput MP-SPDZ achieves in the same settings.

翻译：本文提出新型环上协议，分别实现半诚实安全三方计算（3-PC）和单方腐败恶意安全四方计算（4-PC）。与相同环境下的最先进协议相比，我们的协议在各方之间需要更少的低延迟高带宽链路以实现高通量。同时通过将每门电路基本指令数减少高达50%，降低了计算复杂度。此外，协议实现了当前已知最优通信复杂度（每乘法门3/5个元素），并可通过可选的预处理阶段将在线阶段通信复杂度降至每乘法门2/3个元素。在同构网络环境（即各方间链路共享相似带宽与延迟）下，协议吞吐量较最先进协议提升达两倍。在异构网络环境（即各方间链路具有不同带宽与延迟）下，性能提升更为显著。我们已在新开源的C++框架中实现了所提协议及多种最先进协议，该框架专为高通量优化。所有协议均实现每秒超十亿次32位乘法或超400亿个与门运算，这是目前3-PC和4-PC领域达到的最高吞吐量，较MP-SPDZ在相同设置下的吞吐量高出三个数量级以上。