Cryptology ePrint Archive: Report 2017/908

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

Ivan Damgård and Claudio Orlandi and Mark Simkin

Abstract: We present a very simple yet very powerful idea for turning any passively secure MPC protocol into an actively secure one, at the price of reducing the threshold of tolerated corruptions.

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: Blackbox, MPC

Date: received 19 Sep 2017, last revised 13 Mar 2018

Contact author: simkin at cs au dk

Available format(s): PDF | BibTeX Citation

Version: 20180313:161727 (All versions of this report)

Short URL: ia.cr/2017/908