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 relies only on the existence of four round oblivious transfer. This culminates the long line of research on constructing round-efficient MPC from minimal assumptions (at least w.r.t. black-box simulation).

Category / Keywords: cryptographic protocols / multiparty computation

Date: received 24 Feb 2019, last revised 9 Mar 2020

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

Note: Significant changes made to improve presentation.

Version: 20200309:222346 (All versions of this report)

Short URL: ia.cr/2019/216


[ Cryptology ePrint archive ]