Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas*, Nigel P. Smart, Avishay Yanai

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)

1 Citation (Scopus)
28 Downloads (Pure)

Abstract

Recently, there has been huge progress in the field of concretely efficient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the two-party setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely efficient fully secure protocols, such as SPDZ, require many rounds of communication. In this paper, we present 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. Our construction is based on the constant-round protocol of Beaver et al. (the BMR protocol) and is the first version of that protocol that is concretely efficient for the dishonest majority case. Our protocol includes an online phase that is extremely fast and mainly consists of each party locally evaluating a garbled circuit. For the offline phase, we present both a generic construction (using any underlying MPC protocol) and a highly efficient instantiation based on the SPDZ protocol. Our estimates show the protocol to be considerably more efficient than previous fully secure multi-party protocols.

Original languageEnglish
Pages (from-to)1026-1069
Number of pages44
JournalJournal of Cryptology
Volume32
Issue number3
Early online date26 Apr 2019
DOIs
Publication statusPublished - 15 Jul 2019

Keywords

  • BMR
  • Concrete efficiency
  • Garbled circuits
  • Secure multiparty computation (MPC)
  • SPDZ

Fingerprint Dive into the research topics of 'Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ'. Together they form a unique fingerprint.

  • Cite this