Round Optimal Secure Multiparty Computation from Minimal Assumptions

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We construct a four round secure multip arty 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).
Original languageEnglish
Title of host publicationTheory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II
EditorsRafael Pass, Krzysztof Pietrzak
PublisherSpringer-Verlag
Pages291-319
Number of pages29
ISBN (Electronic)978-3-030-64378-2
ISBN (Print)978-3-030-64377-5
DOIs
Publication statusPublished - 9 Dec 2020
Event18th Theory of Cryptography Conference - Virtual
Duration: 16 Nov 202019 Nov 2020
https://tcc.iacr.org/2020/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12551
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th Theory of Cryptography Conference
Abbreviated titleTCC 2020
CityVirtual
Period16/11/2019/11/20
Internet address

Fingerprint Dive into the research topics of 'Round Optimal Secure Multiparty Computation from Minimal Assumptions'. Together they form a unique fingerprint.

Cite this