Paper 2017/402

A New Approach to Round-Optimal Secure Multiparty Computation

Prabhanjan Ananth, Arka Rai Choudhuri, and Abhishek Jain


We present a new approach towards constructing round-optimal secure multiparty computation (MPC) protocols against malicious adversaries without trusted setup assumptions. Our approach builds on ideas previously developed in the context of covert multiparty computation [Chandran et al., FOCS'07] even though we do not seek covert security. Using our new approach, we obtain the following results: 1. A five round MPC protocol based on the Decisional Diffie-Hellman (DDH) assumption. 2. A four round MPC protocol based on one-way permutations and sub-exponentially secure DDH. This result is {\em optimal} in the number of rounds. Previously, no four-round MPC protocol for general functions was known and five-round protocols were only known based on indistinguishability obfuscation (and some additional assumptions) [Garg et al., EUROCRYPT'16].

Available format(s)
Cryptographic protocols
Publication info
A minor revision of an IACR publication in CRYPTO 2017
Contact author(s)
achoud @ cs jhu edu
2017-08-05: revised
2017-05-11: received
See all versions
Short URL
Creative Commons Attribution


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