Round Optimal Secure Multiparty Computation from Minimal Assumptions

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

Paper 2019/216

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, 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).

Note: Significant changes made to improve presentation.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: multiparty computation
Contact author(s): achoud @ cs jhu edu
goyal @ cs cmu edu
abhishek @ cs jhu edu
mciampi @ ed ac uk
rafail @ cs ucla edu
History: 2020-03-09: last of 2 revisions; 2019-02-27: received; See all versions
Short URL: https://ia.cr/2019/216
License: CC BY

BibTeX

@misc{cryptoeprint:2019/216,
      author = {Arka Rai Choudhuri and Michele Ciampi and Vipul Goyal and Abhishek Jain and Rafail Ostrovsky},
      title = {Round Optimal Secure Multiparty Computation from Minimal Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2019/216},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/216}},
      url = {https://eprint.iacr.org/2019/216}
}