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 (formula presented)) for a 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.
CITATION STYLE
Damgård, I., Orlandi, C., & Simkin, M. (2018). Yet another compiler for active security or: Efficient MPC over arbitrary rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10992 LNCS, pp. 799–829). Springer Verlag. https://doi.org/10.1007/978-3-319-96881-0_27
Mendeley helps you to discover research relevant for your work.