Cryptology ePrint Archive: Report 2019/164

Use your Brain! Arithmetic 3PC For Any Modulus with Active Security

Hendrik Eerikson and Marcel Keller and Claudio Orlandi and Pille Pullonen and Joonas Puura and Mark Simkin

Abstract: Secure multiparty computation (MPC) allows a set of mutually distrustful parties to compute a public function on their private inputs without revealing anything beyond the output of the computation. This paper focuses on the specific case of actively secure three-party computation with an honest majority. In particular, we are interested in solutions which allow to evaluate arithmetic circuits over real-world CPU word sizes, like 32- and 64-bit words. Our starting point is the novel compiler of Damgård et al. from CRYPTO 2018. First, we present an improved version of it which reduces the online communication complexity by a factor of 2. Next, we replace their preprocessing protocol (with arithmetic modulo a large prime) with a more efficient preprocessing which only performs arithmetic modulo powers of two. Finally, we present a novel "postprocessing" check which replaces the preprocessing phase. These protocols offer different efficiency tradeoffs and can therefore outperform each other in different deployment settings. We demonstrate this with benchmarks in a LAN and different WAN settings. Concretely, we achieve a throughput of 1 million 64-bit multiplications per second with parties located in different continents and 3 million in one location.

Category / Keywords: implementation / Secure Multiparty Computation, Information Theoretic Security

Original Publication (in the same form): ITC 2020

Date: received 15 Feb 2019, last revised 2 Nov 2021

Contact author: simkin at cs au dk, orlandi at cs au dk, mks keller at gmail com

Available format(s): PDF | BibTeX Citation

Note: Published version

Version: 20211102:042749 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]