### Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, 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 semi-honest (where the adversary follows the protocol specification but tries to learn more than allowed by examining the protocol transcript) and 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 new protocols for securely computing any functionality represented by an arithmetic circuit. We utilize a new method for verifying that the adversary does not cheat, that yields a cost of just twice that of semi-honest protocols in some settings. Our protocols are information-theoretically secure in the presence of a malicious adversaries, assuming an honest majority. We present protocol variants for small and large fields, and show how to efficiently instantiate them based on replicated secret sharing and Shamir sharing. As with previous works in this area aiming to achieve high efficiency, our protocol is secure with abort and does not achieve fairness, meaning that the adversary may receive output while the honest parties do not. We implemented our protocol and ran experiments for different numbers of parties, different network configurations and different circuit depths. Our protocol significantly outperforms the previous best for this setting (Lindell and Nof, CCS 2017); for a large number of parties, our implementation runs almost an order of magnitude faster than theirs.

Available format(s)
Publication info
A minor revision of an IACR publication in CRYPTO 2018
Keywords
honest majorityarithmetic circuitsinformation-theoretic securityconcrete efficiency
Contact author(s)
nofdinar @ gmail com
yehuda lindell @ biu ac il
danielg3 @ seas upenn edu
kikuchi_ryo @ fw ipsj or jp
hamada koki @ lab ntt co jp
ikarashi dai @ lab ntt co jp
chida koji @ lab ntt co jp
History
2018-07-15: last of 2 revisions
See all versions
Short URL
https://ia.cr/2018/570

CC BY

BibTeX

@misc{cryptoeprint:2018/570,
author = {Koji Chida and Daniel Genkin and Koki Hamada and Dai Ikarashi and Ryo Kikuchi and Yehuda Lindell and Ariel Nof},
title = {Fast Large-Scale Honest-Majority MPC for Malicious Adversaries},
howpublished = {Cryptology ePrint Archive, Paper 2018/570},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/570}},
url = {https://eprint.iacr.org/2018/570}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.