Cryptology ePrint Archive: Report 2019/216

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri and Michele Ciampi and Vipul Goyal and Abhishek Jain and Rafail Ostrovsky

Abstract: We construct a four round secure multiparty computation (MPC) protocol in the plain model that achieves security against any dishonest majority. The security of our protocol only relies on the existence of four round oblivious transfer. This fully resolves the round complexity of MPC (w.r.t. black-box simulation) based on minimal assumptions.

All previous results required either a larger number of rounds or stronger assumptions.

Category / Keywords: cryptographic protocols / multiparty computation

Date: received 24 Feb 2019, last revised 15 Apr 2019

Contact author: achoud at cs jhu edu,goyal@cs cmu edu,abhishek@cs jhu edu,mciampi@ed ac uk,rafail@cs ucla edu

Available format(s): PDF | BibTeX Citation

Version: 20190415:211446 (All versions of this report)

Short URL: ia.cr/2019/216


[ Cryptology ePrint archive ]