Efficient Scalable Constant-Round MPC via Garbled Circuits

@article{BenEfraim2017EfficientSC,
  title={Efficient Scalable Constant-Round MPC via Garbled Circuits},
  author={Aner Ben-Efraim and Yehuda Lindell and Eran Omri},
  journal={IACR Cryptol. ePrint Arch.},
  year={2017},
  volume={2017},
  pages={862}
}
In the setting of secure multiparty computation, a set of mutually distrustful parties carry out a joint computation of their inputs, without revealing anything but the output. Over recent years, there has been tremendous progress towards making secure computation practical, with great success in the two-party case. In contrast, in the multiparty case, progress has been much slower, even for the case of semi-honest adversaries. 
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
TLDR
This paper presents a constant-round multi-party secure computation protocol that is fully secure in the presence of malicious adversaries and for any number of corrupted parties and is the first version of that Protocol that is concretely efficient for the dishonest majority case.
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits
We present a secure multiparty computation (MPC) protocol based on garbled circuits which is both actively secure and supports the free-XOR technique, and which has communication complexity O(n) per
Efficient Maliciously Secure Multiparty Computation for RAM
TLDR
A garbled-circuit-based construction (such as BMR), which benefits from a lower round complexity, must resolve the issue of converting memory data bits to their corresponding wire keys and vice versa.
Concretely efficient secure multi-party computation protocols: survey and more
TLDR
This survey comprehensively survey existing work on concretely efficient MPC protocols with both semi-honest and malicious security, in both dishonest-majority and honest-majority settings, to provide the recent development and key approaches of MPC to researchers.
TinyKeys: A New Approach to Efficient Multi-Party Computation
TLDR
A new approach to designing concretely efficient MPC protocols with semi-honest security in the dishonest majority setting, which results in a more efficient protocol tolerating fewer corruptions, whilst also introducing an LPN-style syndrome decoding assumption.
MPC-Friendly Commitments for Publicly Verifiable Covert Security
TLDR
The notion of PVC commitment scheme and indexed hash functions to build commitment schemes tailored to the PVC framework are introduced, and constructions for both arithmetic and Boolean circuits that result in very efficient circuits are proposed.
Certified Predictions using MPC-Friendly Publicly Verifiable Covertly Secure Commitments
TLDR
The notion of a PVC commitment scheme 1 and indexed hash functions to build commitment schemes tailored to the PVC framework are introduced, and constructions for both arithmetic and Boolean circuits that result in very efficient circuits are proposed.
More Efficient MPC from Improved Triple Generation and Authenticated Garbling
TLDR
A new protocol for generating authenticated AND triples, which is a key building block in many recent works, is proposed and a new authenticated bit protocol is proposed in the two-party and multi-party settings from bare IKNP OT extension, allowing to reduce the communication by about $24% and eliminate many computation bottlenecks.
Using Secure Multi-Party Computation to Protect Privacy on a Permissioned Blockchain
TLDR
This paper used homomorphic encryption, secret sharing and zero-knowledge proofs to construct a publicly verifiable secure MPC protocol and integrated the protocol as part of the chaincode in Hyperledger Fabric to protect the privacy of transaction data.
...
...

References

SHOWING 1-10 OF 39 REFERENCES
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
TLDR
Two highly efficient constant-round protocols are constructed for the setting of multiparty computation for semi-honest adversaries by constructing a multiparty garbled circuit, as proposed in BMR (Beaver et al., STOC 1990).
Dishonest Majority Multi-Party Computation for Binary Circuits
TLDR
The Tiny-OT two party protocol is extended to the case of n parties in the dishonest majority setting by presenting a novel way of transferring pairwise authentications into global authentications, which leads to a more efficient two party Protocol than that of Nielsen et al.
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
TLDR
This paper presents a constant-round multi-party secure computation protocol that is fully secure in the presence of malicious adversaries and for any number of corrupted parties and is the first version of that Protocol that is concretely efficient for the dishonest majority case.
A Proof of Security of Yao’s Protocol for Two-Party Computation
TLDR
This paper provides a complete description of Yao’s protocol, along with a rigorous proof of security, for the first time that an explicitProof of security has been published.
Global-Scale Secure Multiparty Computation
TLDR
This work designs an efficient preprocessing phase that allows the parties to generate authenticated information; it shows how to use this information to distributively construct a single "authenticated" garbled circuit that is evaluated by one party.
Faster Secure Two-Party Computation Using Garbled Circuits
TLDR
This work demonstrates several techniques for improving the running time and memory requirements of the garbled-circuit technique, resulting in an implementation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits.
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits
TLDR
A covertly secure key generation protocol for obtaining a BGV public key and a shared associated secret key and both a covertly and actively secure preprocessing phase are constructed, both of which compare favourably with previous work in terms of efficiency and provable security.
GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
TLDR
This paper presents a new approach to secure two-party computation based on Yao’s garbled circuits and the protocol of Goldreich-Micali-Wigderson (GMW).
Improved Garbled Circuit: Free XOR Gates and Applications
TLDR
In this one-round protocol, XOR gates are evaluated "for free", which results in the corresponding improvement over the best garbled circuit implementations (e.g. Fairplay) and improves integer addition and equality testing by factor of up to 2.
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
TLDR
This work implements the MPC protocol of Goldreich, Micali, and Wigderson, which uses a boolean representation and is secure against a semi-honest adversary corrupting any number of parties, and outperforms existing implementations including FairplayMP, VIFF, and SEPIA.
...
...