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

Arpita Patra; Akshayaram Srinivasan

Paper 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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: A minor revision of an IACR publication in CRYPTO 2021
Keywords: Black-Box Oblivious Transfer Round-Optimal MPC
Contact author(s): akshayaram @ berkeley edu
History: 2021-08-14: revised; 2021-07-22: received; See all versions
Short URL: https://ia.cr/2021/957
License: CC BY

BibTeX

@misc{cryptoeprint:2021/957,
      author = {Arpita Patra and Akshayaram Srinivasan},
      title = {Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/957},
      year = {2021},
      url = {https://eprint.iacr.org/2021/957}
}