Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai; Dakshita Khurana; Amit Sahai; Akshayaram Srinivasan

Paper 2023/1173

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai, Technion – Israel Institute of Technology

Dakshita Khurana, University of Illinois Urbana-Champaign

Amit Sahai, University of California, Los Angeles

Akshayaram Srinivasan, Tata Institute of Fundamental Research

Abstract

We give the first construction of a fully black-box round-optimal secure multiparty computation (MPC) protocol in the plain model. Our protocol makes black-box use of a sub-exponentially secure two-message statistical sender private oblivious transfer (SSP-OT), which in turn can be based on (sub-exponential variants of) almost all of the standard cryptographic assumptions known to imply public-key cryptography.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: A major revision of an IACR publication in CRYPTO 2023
Keywords: Round-optimality MPC Plain Model SSP-OT
Contact author(s): yuvali @ cs technion ac il
dakshita @ illinois edu
sahai @ cs ucla edu
akshayaram @ berkeley edu
History: 2023-08-07: revised; 2023-07-30: received; See all versions
Short URL: https://ia.cr/2023/1173
License: CC BY

BibTeX

@misc{cryptoeprint:2023/1173,
      author = {Yuval Ishai and Dakshita Khurana and Amit Sahai and Akshayaram Srinivasan},
      title = {Round-Optimal Black-Box MPC in the Plain Model},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1173},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/1173}},
      url = {https://eprint.iacr.org/2023/1173}
}