Paper 2017/816
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority
Yehuda Lindell and Ariel Nof
Abstract
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be preserved in the presence of adversarial behavior. The two classic adversary models considered are \emph{semi-honest} (where the adversary follows the protocol specification but tries to learn more than allowed by examining the protocol transcript) and \emph{malicious} (where the adversary may follow any arbitrary attack strategy). Protocols for semi-honest adversaries are often far more efficient, but in many cases the security guarantees are not strong enough.
In this paper, we present a new efficient method for ``compiling'' a large class of protocols that are secure in the presence of semi-honest adversaries into protocols that are secure in the presence of malicious adversaries. Our method assumes an honest majority (i.e., that
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. ACM CCS 2017
- Contact author(s)
- nofdinar @ gmail com
- History
- 2018-12-12: last of 3 revisions
- 2017-08-31: received
- See all versions
- Short URL
- https://ia.cr/2017/816
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/816, author = {Yehuda Lindell and Ariel Nof}, title = {A Framework for Constructing Fast {MPC} over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/816}, year = {2017}, url = {https://eprint.iacr.org/2017/816} }