Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas, Nigel Smart, Avishay Yanai

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

51 Citations (Scopus)


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 an MPC 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 BMR protocol of Beaver et al., and is the first fully-secure version of that protocol that makes black-box usage of the underlying primitives, and is therefore concretely efficient.

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
Title of host publicationAdvances in Cryptology - CRYPTO 2015
Number of pages20
ISBN (Electronic)9783662480007
ISBN (Print)9783662479995
Publication statusPublished - 19 Aug 2015

Publication series

NameLecture Notes in Computer Science


Dive into the research topics of 'Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ'. Together they form a unique fingerprint.
  • UK-Israel MPC

    Smart, N. P.


    Project: Research

  • COED - Computing on Encrypted Data

    Smart, N. P.


    Project: Research

Cite this