Paper 2018/572

Round-Optimal Secure Multiparty Computation with Honest Majority

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, and Abhishek Jain


We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal $n$-party protocols, tolerating any $t<\frac{n}{2}$ corruptions. - Security with abort: We give the first construction of two round MPC for general functions that achieves security with abort against malicious adversaries in the plain model. The security of our protocol only relies on one-way functions. - Guaranteed output delivery: We also construct protocols that achieve security with guaranteed output delivery: (i) Against fail-stop adversaries, we construct two round MPC either in the (bare) public-key infrastructure model with no additional assumptions, or in the plain model assuming two-round semi-honest oblivious transfer. In three rounds, however, we can achieve security assuming only one-way functions. (ii) Against malicious adversaries, we construct three round MPC in the plain model, assuming public-key encryption and Zaps. Previously, such protocols were only known based on specific learning assumptions and required the use of common reference strings. All of our results are obtained via general compilers that may be of independent interest.

Note: Added citation to concurrent work

Available format(s)
Publication info
Published by the IACR in CRYPTO 2018
Secure Computation
Contact author(s)
prabhanjan @ csail mit edu
achoud @ cs jhu edu
agoel10 @ jhu edu
abhishek @ cs jhu edu
2018-09-10: last of 5 revisions
2018-06-05: received
See all versions
Short URL
Creative Commons Attribution


      author = {Prabhanjan Ananth and Arka Rai Choudhuri and Aarushi Goel and Abhishek Jain},
      title = {Round-Optimal Secure Multiparty Computation with Honest Majority},
      howpublished = {Cryptology ePrint Archive, Paper 2018/572},
      year = {2018},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.