Our compiler leads to a very efficient MPC protocols for the important case of secure evaluation of arithmetic circuits over arbitrary rings (e.g., the natural case of $\mathbb{Z}_{2^{\ell}}\!$) for small number of parties. We show this by giving a concrete protocol in the preprocessing model for the popular setting with three parties and one corruption. This is the first protocol for secure computation over rings that achieves active security with constant overhead.
Category / Keywords: cryptographic protocols / MPC, Blackbox, Compiler Date: received 19 Sep 2017 Contact author: simkin at cs au dk Available format(s): PDF | BibTeX Citation Version: 20170924:213545 (All versions of this report) Short URL: ia.cr/2017/908 Discussion forum: Show discussion | Start new discussion