Paper 2019/216 Original: eprint.iacr.org/2019/216 ↗
Round Optimal Secure Multiparty Computation from Minimal Assumptions
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).
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2020-03-09: last updated
- 2019-02-27: published
- Short URL
- https://ia.cr/2019/216
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2019/216}
}