You are looking at a specific version 20180313:161727 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Publication info
- Preprint.
- Keywords
- BlackboxMPC
- Contact author(s)
- simkin @ cs au dk
- History
- 2018-03-13: last of 4 revisions
- 2017-09-24: received
- See all versions
- Short URL
- https://ia.cr/2017/908
- License
-
CC BY