Lecture notes in computer science

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

Thomas Attema, Vincent Dunning, Maarten H. Everts, P.N. Langenkamp

Published Jan 1, 2022• 5 citations

Related papers

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

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

Generic Compiler for Publicly Verifiable Covert Multi-Party Computation

Sebastian Faust, Carmit Hazay, David Kretzler +1 more

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

Ivan Damgård, Claudio Orlandi, Mark Simkin

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Carsten Baum, Emmanuela Orsini, Peter Schöll +1 more

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security

Benny Applebaum, Eliran Kachlon, Arpita Patra

Covert Security with Public Verifiability: Faster, Leaner, and Simpler

Hong Cheng, Jonathan I. Katz, Vladimir Kolesnikov +2 more