Lecture notes in computer science

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

Mark Abspoel, Anders Dalskov, Daniel E. Escudero, Ariel Nof

Published Jan 1, 2021• 29 citations

Publisher

DOI: 10.1007/978-3-030-78375-4_6

Related papers

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

Ivan Damgård, Claudio Orlandi, Mark Simkin

Lecture notes in computer scienceJan 1, 201837 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

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

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

Peter Sebastian Nordholt, Meilof Veeningen

Lecture notes in computer scienceJan 1, 201840 citations

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

Koji Chida, Daniel Genkin, Koki Hamada +4 more

Lecture notes in computer scienceJan 1, 2018145 citations

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

Emmanuela Orsini

Lecture notes in computer scienceJan 1, 202113 citations