article

Free access

Secure multiparty computation

Author:

Yehuda LindellAuthors Info & Claims

Communications of the ACM, Volume 64, Issue 1

Pages 86 - 96

https://doi.org/10.1145/3387108

Published: 17 December 2020 Publication History

All formats PDF

Abstract

MPC has moved from theoretical study to real-world usage. How is it doing?

References

[1]

Aumann, Y., Lindell, Y. Security against covert adversaries: Efficient protocols for realistic adversaries. J. Cryptol. 23, 2 (2010), 281--343 (extended abstract at TCC 2007).

Digital Library

Google Scholar

[2]

Beaver, D., Micali, S., Rogaway, P. The round complexity of secure protocols. In 22^nd STOC (1990), 503--513.

Digital Library

Google Scholar

[3]

Ben-Or, M., Goldwasser, S., Wigderson, A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20^th STOC (1988), 1--10.

Digital Library

Google Scholar

[4]

Beerliová-Trubíniová, Z., Hirt, M. Perfectly-secure MPC with linear communication complexity. In TCC 2008 (2008), Springer (LNCS 4948), 213--230.

Crossref

Google Scholar

[5]

Canetti, R. Security and composition of multiparty cryptographic protocols. J. Cryptol. 13, 1 (2000), 143--202.

Digital Library

Google Scholar

[6]

Canetti, R. Universally composable security: A new paradigm for cryptographic protocols. In the 42^nd FOCS (2001), 136--145.

Google Scholar

[7]

Canetti, R., Herzberg, A. Maintaining security in the presences of transient faults. In CRYPTO'94 (1994), Springer-Verlag (LNCS 839), 425--438.

Crossref

Google Scholar

[8]

Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A. Universally composable two-party and multi-party computation. In the 34^th STOC (2002), 494--503. http://eprint.iacr.org/2002/140.

Google Scholar

[9]

Chaum, D., Crépeau, C., Damgård, I. Multi-party unconditionally secure protocols. In the 20^th STOC (1988), 11--19.

Google Scholar

[10]

Chida, K., Genkin, K., Hamada, K., Ikarashi, D., Kikuchi, R., Lindell, Y., Nof, A. Fast large-scale honest-majority MPC for malicious adversaries. In CRYPTO 2018 (2018), Springer (LNCS 10993), 34--64.

Digital Library

Google Scholar

[11]

Cleve, R. Limits on the security of coin flips when half the processors are faulty. In the 18^th STOC (1986), 364--369.

Google Scholar

[12]

Damgård, I., Nielsen, J. Scalable and unconditionally secure multiparty computation. In CRYPTO 2007 (2007), Springer (LNCS 4622), 572--590.

Crossref

Google Scholar

[13]

Damgård, I., Pastro, V., Smart, N.P., Zakarias, S. Multiparty computation from somewhat homomorphic encryption. In CRYPTO 2012 (2012), Springer (LNCS 7417), 643--662.

Digital Library

Google Scholar

[14]

Doerner, J., Kondi, Y., Lee, E., Shelat, A. Threshold ECDSA from ECDSA assumptions: The multiparty case. In IEEE Symposium on Security and Privacy 2019 (2019), 1051--1066.

Crossref

Google Scholar

[15]

Evans, D., Kolesnikov, V., Rosulek, M. A Pragmatic Introduction to Secure Multi-Party Computation. NOW Publishers, 2018.

Crossref

Google Scholar

[16]

Furukawa, J., Lindell, Y. Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In the 26^th ACM CCS (2019), 1557--1571.

Google Scholar

[17]

Gennaro, R., Goldfeder, S. Fast multiparty threshold ECDSA with fast trustless setup. In the 25^th ACM CCS 2018 (2018), 1179--1194.

Digital Library

Google Scholar

[18]

Goldreich, O., Micali, S., Wigderson, A. How to play any mental game -- A completeness theorem for protocols with honest majority. In the 19^th STOC (1987), O. Goldreich, ed. Volume 2 of Foundations of Cryptography -- Basic Applications (2004), Cambridge University Press, 218--229.

Google Scholar

[19]

Hastings, M., Hemenway, B., Noble, D., Zdancewic, S. SoK: General purpose compilers for secure multi-party computation. In IEEE Symposium on Security and Privacy 2019 (2019), 1220--1237.

Crossref

Google Scholar

[20]

Ion, M., Kreuter, B., Nergiz, E., Patel, S., Saxena, S., Seth, K., Shanahan, D., Yung, M. Private intersection-sum protocol with applications to attributing aggregate Ad conversions. IACR Cryptology ePrint Archive, Report 2017 (2017), 738.

Google Scholar

[21]

Ishai, Y., Kilian, J., Nissim, K., Petrank, E. Extending oblivious transfers efficiently. In CRYPTO 2003 (2003), Springer (LNCS 2729), 145--161.

Crossref

Google Scholar

[22]

Ishai, Y., Prabhakaran, M., Sahai, A. Founding cryptography on oblivious transfer -- Efficiently. In CRYPTO 2008 (2008), Springer (LNCS 5157), 572--591.

Digital Library

Google Scholar

[23]

Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N. Efficient batched oblivious PRF with applications to private set intersection. In the 23^rd ACM CCS (2016), 818--829.

Google Scholar

[24]

Kolesnikov, V., Schneider, T. Improved garbled circuit: Free XOR gates and applications. In ICALP 2008 (2008), Springer (LNCS 5126), 486--498.

Digital Library

Google Scholar

[25]

Lapets, A., Jansen, F., Albab, K.D., Issa, R., Qin, L., Varia, M., Bestavros, A. Accessible privacy-preserving web-based data analysis for assessing and addressing economic inequalities. In COMPASS 2018 (2018), 48:1--48:5.

Digital Library

Google Scholar

[26]

Lindell, Y. Fast secure two-party ECDSA signing. In CRYPTO 2017 (2017), Springer (LNCS 10402), 613--644.

Crossref

Google Scholar

[27]

Lindell, Y., Nof, A. Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In the 25^th ACM CCS (2018), 1837--1854.

Google Scholar

[28]

Lindell, Y., Pinkas, B. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In EUROCRYPT (2007), Springer, 52--78.

Digital Library

Google Scholar

[29]

Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S. A new approach to practical active-secure two-party computation. In CRYPTO 2012 (2012), Springer (LNCS 7417), 681--700.

Digital Library

Google Scholar

[30]

Ostrovsky, R., Yung, M. How to withstand mobile virus attacks. In 10^th PODC (1991), 51--59.

Google Scholar

[31]

Pinkas, B., Rosulek, M., Trieu, N., Yanai, A. SpOT-light: Lightweight private set intersection from sparse OT extension. In CRYPTO 2019 (2019), Springer (LNCS 11694), 401--431.

Digital Library

Google Scholar

[32]

Pinkas, B., Schneider, T., Zohner, M. Scalable private set intersection based on OT extension. ACM T. Privacy Sec. 21, 2:7 (2018), 1--35.

Google Scholar

[33]

Rabin, T., Ben-Or, M. Verifiable secret sharing and multi-party protocols with honest majority. In the 21^st STOC (1989), 73--85.

Google Scholar

[34]

Shamir, A. How to share a secret. CACM 22, 11 (1979), 612--613.

Digital Library

Google Scholar

[35]

Shoup, V. Practical threshold signatures. In EUROCRYPT 2000 (2000), Springer (LNCS 1807), 207--220.

Google Scholar

[36]

Vardi, M. The long game of research. CACM 62, 9 (2019), 7.

Digital Library

Google Scholar

[37]

Yao, A. How to generate and exchange secrets. In 27^th FOCS (1986), 162--167.

Digital Library

Google Scholar

[38]

Unbound Tech. (www.unboundtech.com), Sepior (sepior.com), and Curv (www.curv.co).

Google Scholar

[39]

Sharemind, https://sharemind.cyber.ee.

Google Scholar

[40]

Duality, https://duality.cloud.

Google Scholar

Cited By

View all

Ahmed ISyed MMaaruf MKhalid M(2025)Distributed computing in multi-agent systems: a survey of decentralized machine learning approachesComputing10.1007/s00607-024-01356-0107:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s00607-024-01356-0
Mortensen BNordal MStrand M(2024)Matching radar signals and fingerprints with MPCIACR Communications in Cryptology10.62056/aywa0l5vtOnline publication date: 7-Oct-2024
https://doi.org/10.62056/aywa0l5vt
Rahaman MArya VOrozco SPappachan P(2024)Secure Multi-Party Computation (SMPC) Protocols and PrivacyInnovations in Modern Cryptography10.4018/979-8-3693-5330-1.ch008(193-218)Online publication date: 14-Aug-2024
https://doi.org/10.4018/979-8-3693-5330-1.ch008
Show More Cited By

Index Terms

Secure multiparty computation
1. Theory of computation
  1. Computational complexity and cryptography

Recommendations

Optimizing Semi-Honest Secure Multiparty Computation for the Internet
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, the efficiency of secure two-party computation has ...
Two-round Multiparty Secure Computation from Minimal Assumptions
We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest ...
Zero-knowledge from secure multiparty computation
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

We present a general construction of a zero-knowledge proof for an NP relation R(x,w) which only makes a black-box use of a secure protocol for a related multi-partyfunctionality f. The latter protocol is only required to be secure against a small ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 64, Issue 1

January 2021

115 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3444848

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 December 2020

Published in CACM Volume 64, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

117
Total Citations
View Citations
16,193
Total Downloads

Downloads (Last 12 months)2,894
Downloads (Last 6 weeks)298

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ahmed ISyed MMaaruf MKhalid M(2025)Distributed computing in multi-agent systems: a survey of decentralized machine learning approachesComputing10.1007/s00607-024-01356-0107:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s00607-024-01356-0
Mortensen BNordal MStrand M(2024)Matching radar signals and fingerprints with MPCIACR Communications in Cryptology10.62056/aywa0l5vtOnline publication date: 7-Oct-2024
https://doi.org/10.62056/aywa0l5vt
Rahaman MArya VOrozco SPappachan P(2024)Secure Multi-Party Computation (SMPC) Protocols and PrivacyInnovations in Modern Cryptography10.4018/979-8-3693-5330-1.ch008(193-218)Online publication date: 14-Aug-2024
https://doi.org/10.4018/979-8-3693-5330-1.ch008
Arzovs AJudvaitis JNesenbergs KSelavo L(2024)Distributed Learning in the IoT–Edge–Cloud ContinuumMachine Learning and Knowledge Extraction10.3390/make60100156:1(283-315)Online publication date: 1-Feb-2024
https://doi.org/10.3390/make6010015
Adarbah HKiraz MKardas SAl-Bayatti AAl-Bayatti H(2024)A New Framework for Enhancing VANETs through Layer 2 DLT Architectures with Multiparty Threshold Key Management and PETsFuture Internet10.3390/fi1609032816:9(328)Online publication date: 9-Sep-2024
https://doi.org/10.3390/fi16090328
Shen JZhao YHuang SRen Y(2024)Secure and Flexible Privacy-Preserving Federated Learning Based on Multi-Key Fully Homomorphic EncryptionElectronics10.3390/electronics1322447813:22(4478)Online publication date: 14-Nov-2024
https://doi.org/10.3390/electronics13224478
Miladinović DMilaković AVukasović MStanisavljević ŽVuletić P(2024)Secure Multiparty Computation Using Secure Virtual MachinesElectronics10.3390/electronics1305099113:5(991)Online publication date: 5-Mar-2024
https://doi.org/10.3390/electronics13050991
Liberti FBerardi DMartini B(2024)Federated Learning in Dynamic and Heterogeneous Environments: Advantages, Performances, and Privacy ProblemsApplied Sciences10.3390/app1418849014:18(8490)Online publication date: 20-Sep-2024
https://doi.org/10.3390/app14188490
Ramos SEllul J(2024)Blockchain for Artificial Intelligence (AI): enhancing compliance with the EU AI Act through distributed ledger technology. A cybersecurity perspectiveInternational Cybersecurity Law Review10.1365/s43439-023-00107-95:1(1-20)Online publication date: 25-Jan-2024
https://doi.org/10.1365/s43439-023-00107-9
Prediger LJälkö JHonkela AKaski S(2024)Collaborative learning from distributed data with differentially private synthetic dataBMC Medical Informatics and Decision Making10.1186/s12911-024-02563-724:1Online publication date: 14-Jun-2024
https://doi.org/10.1186/s12911-024-02563-7
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

Two-round Multiparty Secure Computation from Minimal Assumptions

Zero-knowledge from secure multiparty computation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations