Use your brain! Arithmetic 3PC for any modulus with active security

TY - GEN

T1 - Use your brain! Arithmetic 3PC for any modulus with active security

AU - Eerikson, Hendrik

AU - Keller, Marcel

AU - Orlandi, Claudio

AU - Pullonen, Pille

AU - Puura, Joonas

AU - Simkin, Mark

PY - 2020/6

Y1 - 2020/6

N2 - 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.

AB - 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.

KW - Secure Multiparty Computation, Information Theoretic Security

UR - https://www.scopus.com/pages/publications/85092759824

U2 - 10.4230/LIPIcs.ITC.2020.5

DO - 10.4230/LIPIcs.ITC.2020.5

M3 - Article in proceedings

AN - SCOPUS:85092759824

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 1st Conference on Information-Theoretic Cryptography (ITC 2020)

A2 - Kalai, Yael Tauman

A2 - Smith, Adam D.

A2 - Wichs, Daniel

PB - Dagstuhl Publishing

T2 - 1st Conference on Information-Theoretic Cryptography, ITC 2020

Y2 - 17 June 2020 through 19 June 2020

ER -