[Resource Topic] 2019/216: Round Optimal Secure Multiparty Computation from Minimal Assumptions

Welcome to the resource topic for 2019/216

Title:
Round Optimal Secure Multiparty Computation from Minimal Assumptions

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

ePrint: https://eprint.iacr.org/2019/216

Talk: https://www.youtube.com/watch?v=NJKeOvCmqgo

Slides: https://iacr.org/submit/files/slides/2020/tcc/tcc2020/195/slides.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .