Cryptology ePrint Archive: Report 2017/402

A New Approach to Round-Optimal Secure Multiparty Computation

Prabhanjan Ananth and Arka Rai Choudhuri and Abhishek Jain

Abstract: 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].

Category / Keywords: cryptographic protocols /

Original Publication (with minor differences): IACR-CRYPTO-2017

Date: received 9 May 2017, last revised 5 Aug 2017

Contact author: achoud at cs jhu edu

Available format(s): PDF | BibTeX Citation

Version: 20170805:222615 (All versions of this report)

Short URL: ia.cr/2017/402