## CryptoDB

### Paper: Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Authors: Arpita Patra , Indian Institute of Science Akshayaram Srinivasan , Tata Institute of Fundamental Research Search ePrint Search Google Slides CRYPTO 2021 We give constructions of three-round secure multiparty computation (MPC) protocols for general functions that make {\it black-box} use of a two-round oblivious transfer (OT). For the case of semi-honest adversaries, we make use of a two-round, semi-honest secure OT in the plain model. This resolves the round-complexity of black-box (semi-honest) MPC protocols from minimal assumptions and answers an open question of Applebaum et al. (ITCS 2020). For the case of malicious adversaries, we make use of a two-round maliciously-secure OT in the common random/reference string model that satisfies a (mild) variant of adaptive security for the receiver.
##### BibTeX
@inproceedings{crypto-2021-31142,
title={Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer},
publisher={Springer-Verlag},
author={Arpita Patra and Akshayaram Srinivasan},
year=2021
}