Cryptology ePrint Archive: Report 2017/597

Round Optimal Concurrent MPC via Strong Simulation

Saikrishna Badrinarayanan and Vipul Goyal and Abhishek Jain and Dakshita Khurana and Amit Sahai

Abstract: In this paper, we study the round complexity of concurrently secure multi-party computation (MPC) with super-polynomial simulation (SPS) in the plain model. In the plain model, there are known explicit attacks that show that concurrently secure MPC with polynomial simulation is impossible to achieve; SPS security is the most widely studied model for concurrently secure MPC in the plain model.

We obtain the following results:

– Three-round concurrent MPC with SPS security against Byzantine adversaries, assuming sub-exponentially secure DDH and LWE.

– Two-round concurrent MPC with SPS security against Byzantine adversaries for input-less randomized functionalities, assuming sub- exponentially secure indistinguishability obfuscation and DDH. In particular, this class includes sampling functionalities that allow parties to jointly sample a secure common reference string for cryptographic applications.

Prior to our work, to the best of our knowledge, concurrent MPC with SPS security required roughly 20 rounds, although we are not aware of any work that even gave an approximation of the constant round complexity sufficient for the multi-party setting. We also improve over the previous best round complexity for the two-party setting, where 5 rounds were needed (Garg, Kiyoshima, and Pandey, Eurocrypt 2017).

To obtain our results, we compile protocols that already achieve security against “semi-malicious” adversaries, to protocols secure against fully malicious adversaries, additionally assuming sub-exponential DDH. Our protocols develop new techniques to use two-round zero-knowledge with super-polynomial strong simulation, defined by Pass (Eurocrypt 2003) and very recently realized by Khurana and Sahai (FOCS 2017). These remain zero-knowledge against adversaries running in time larger than the running time of the simulator.

Category / Keywords: cryptographic protocols / concurrent mpc, superpolynomial simulation, strong simulation, three rounds.

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

Date: received 20 Jun 2017, last revised 26 Sep 2017

Contact author: saikrishna at cs ucla edu

Available format(s): PDF | BibTeX Citation

Version: 20170926:060201 (All versions of this report)

Short URL: ia.cr/2017/597

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]