Welcome to the resource topic for 2017/908
Title:
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
Authors: Ivan Damgård, Claudio Orlandi, 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.
ePrint: https://eprint.iacr.org/2017/908
Talk: https://www.youtube.com/watch?v=CtSsbYFzHyw
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .