Paper 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.