Lecture notes in computer science

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

Ivan Damgård, Claudio Orlandi, Mark Simkin

Published Jan 1, 2018• 37 citations

DOI: 10.1007/978-3-319-96881-0_27

Related papers

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

Ivan Damgård, Claudio Orlandi, Mark Simkin

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.

Jan 1, 20173 citations

An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings

Mark Abspoel, Anders Dalskov, Daniel E. Escudero +1 more

Lecture notes in computer scienceJan 1, 202129 citations

Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC

Thomas Attema, Vincent Dunning, Maarten H. Everts +1 more

Lecture notes in computer scienceJan 1, 20225 citations

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Carmit Hazay, Emmanuela Orsini, Peter Schöll +1 more

Lecture notes in computer scienceJan 1, 201828 citations

Efficient, Actively Secure MPC with a Dishonest Majority: A Survey

Emmanuela Orsini

Lecture notes in computer scienceJan 1, 202113 citations

On Actively-Secure Elementary MPC Reductions

Benny Applebaum, Aarushi Goel

Lecture notes in computer scienceJan 1, 20211 citation