Cryptology ePrint Archive: Report 2021/957

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

Arpita Patra and Akshayaram Srinivasan

Abstract: We give constructions of three-round secure multiparty computation (MPC) protocols for general functions that make black-box use of a two-round oblivious transfer. For the case of semi-honest adversaries, we make use of a two-round, semi-honest secure oblivious transfer 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 oblivious transfer in the common random/reference string model that satisfies a (mild) variant of adaptive security for the receiver.

Category / Keywords: foundations / Black-Box, Oblivious Transfer, Round-Optimal MPC

Original Publication (with minor differences): IACR-CRYPTO-2021

Date: received 16 Jul 2021, last revised 14 Aug 2021

Contact author: akshayaram at berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20210814:134936 (All versions of this report)

Short URL: ia.cr/2021/957


[ Cryptology ePrint archive ]