[Resource Topic] 2017/402: A New Approach to Round-Optimal Secure Multiparty Computation

Welcome to the resource topic for 2017/402

A New Approach to Round-Optimal Secure Multiparty Computation

Authors: Prabhanjan Ananth, Arka Rai Choudhuri, 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].

ePrint: https://eprint.iacr.org/2017/402

Talk: https://www.youtube.com/watch?v=cwQ0RGa3-b0

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .