Authors
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Publication date
2020/10
Journal
Journal of cryptology
Volume
33
Issue
4
Pages
1732-1786
Publisher
Springer US
Description
In this work, we present two new actively secure, constant-round multi-party computation (MPC) protocols with security against all-but-one corruptions. Our protocols both start with an actively secure MPC protocol, which may have linear round complexity in the depth of the circuit, and compile it into a constant-round protocol based on garbled circuits, with very low overhead.
  1. 1.
    Our first protocol takes a generic approach using any secret-sharing-based MPC protocol for binary circuits, and a correlated oblivious transfer functionality.
  2. 2.
    Our second protocol builds on secret-sharing-based MPC with information-theoretic MACs. This approach is less flexible, being based on a specific form of MPC, but requires no additional oblivious transfers to compute the garbled circuit.
In both approaches, the underlying secret-sharing-based protocol is only used for one actively secure multiplication per AND gate. An …
Total citations
2015201620172018201920202021202220232024157111725212113
Scholar articles