Paper 2020/300

Secure Multiparty Computation (MPC)

Yehuda Lindell

Abstract

Protocols for secure multiparty computation (MPC) enable a set of parties to interact and compute a joint function of their private inputs while revealing nothing but the output. The potential applications for MPC are huge: privacy-preserving auctions, private DNA comparisons, private machine learning, threshold cryptography, and more. Due to this, MPC has been an intensive topic of research in academia ever since it was introduced in the 1980s by Yao for the two-party case (FOCS 1986), and by Goldreich, Micali and Wigderson for the multiparty case (STOC 1987). Recently, MPC has become efficient enough to be used in practice, and has made the transition from an object of theoretical study to a technology being used in industry. In this article, we will review what MPC is, what problems it solves, and how it is being currently used. We note that the examples and references brought in this review article are far from comprehensive, and due to the lack of space many highly relevant works are not cited.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. MINOR revision.In the Communications of the ACM (CACM), 64(1):86-96, 2021.
DOI
10.1145/3387108
Keywords
survey
Contact author(s)
lindell @ biu ac il
History
2021-01-31: revised
2020-03-09: received
See all versions
Short URL
https://ia.cr/2020/300
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/300,
      author = {Yehuda Lindell},
      title = {Secure Multiparty Computation (MPC)},
      howpublished = {Cryptology ePrint Archive, Paper 2020/300},
      year = {2020},
      doi = {10.1145/3387108},
      note = {\url{https://eprint.iacr.org/2020/300}},
      url = {https://eprint.iacr.org/2020/300}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.