Paper 2023/1173 Original: eprint.iacr.org/2023/1173 ↗

Round-Optimal Black-Box MPC in the Plain Model

Yuval Ishai
Dakshita Khurana
Amit Sahai
Akshayaram Srinivasan
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
Preprint.
History
2023-08-07: last updated
2023-07-30: published
Short URL
https://ia.cr/2023/1173
License
https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2023/1173}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.