secure multi-party computation

secure multi-party computation
Name	Secure multi-party computation
Abbreviation	SMPC
Field	Cryptography
Related	Homomorphic encryption, Zero-knowledge proofs, Threshold cryptography
Introduced	1980s

secure multi-party computation

Secure multi-party computation enables multiple parties to jointly compute a function over their private inputs while keeping those inputs confidential, combining ideas from Whitfield Diffie, Martin Hellman, Adi Shamir, Ronald Rivest, Shafi Goldwasser, Silvio Micali, and Oded Goldreich. The field draws on primitives developed at institutions such as MIT, Bell Labs, IACR, Stanford University, Harvard University and IBM Research. Its development has been influenced by events and programs including the DARPA information security initiatives, the National Science Foundation fellowships, and collaborations at Microsoft Research and Google Research.

Definition and Overview

secure multi-party computation refers to protocols that allow participants like Alice Walker-style parties, industry actors such as Facebook, Amazon, Apple Inc., Twitter, and governmental agencies such as the National Security Agency, GCHQ, and European Commission to compute joint functions while protecting inputs. Key foundational works include techniques from Yao's Millionaires' problem contributors such as Andrew Yao and follow-on proofs by Oded Goldreich and Silvio Micali. The field intersects with concepts embodied in artifacts like RSA (cryptosystem), Diffie–Hellman key exchange, and results from researchers at ETH Zurich, Princeton University, University of California, Berkeley, Weizmann Institute of Science, and Tel Aviv University.

Historical Development and Milestones

Early milestones include Andrew Yao's protocol and the propagation of ideas through venues such as CRYPTO, EUROCRYPT, and STOC. Seminal contributions involved researchers like Michael Ben-Or, Ran Canetti, Ivan Damgård, Moni Naor, Moti Yung, and Tal Rabin, with influential papers presented at IEEE Symposium on Foundations of Computer Science and ACM SIGCOMM. Major practical demonstrations and collaborations occurred at Bell Labs, AT&T Laboratories, Microsoft Research Redmond, IBM T.J. Watson Research Center, and projects funded by DARPA and European Research Council. Breakthroughs in performance and composability were achieved by teams at Cornell University, Johns Hopkins University, Imperial College London, University College London, and Columbia University.

Models, Security Definitions, and Assumptions

Security models often reference adversary types studied by Yevgeniy Dodis, Ran Canetti, Jonathan Katz, Vinod Vaikuntanathan, and Elette Boyle. Formal frameworks use notions introduced at venues like FOCS, EUROCRYPT, ASIACRYPT, and PKC. Assumptions draw from hardness statements embodied in RSA, Decisional Diffie–Hellman problem, Learning with Errors, Elliptic Curve Cryptography, Bilinear pairings, and primitives like Pseudorandom generators and Oblivious transfer. Composability frameworks such as Universal Composability were introduced by Ran Canetti and extended with contributions from Rafael Pass and Ueli Maurer.

Protocols and Techniques

Core protocols include garbled circuits developed by Andrew Yao, secret sharing introduced by Adi Shamir, threshold techniques advanced by Desmedt and Victor Shoup, and oblivious transfer schemes revisited by Michael O. Rabin, Silvio Micali, and Moni Naor. Modern optimizations integrate homomorphic encryption research by Craig Gentry, zero-knowledge proof systems from Zooko Wilcox-O'Hearn-adjacent communities and succinct proofs like STARKs and SNARKs by teams at Princeton University and Draper Laboratory. Implementations use toolkits and languages from OpenMined, Enigma, Zama, Intel SGX enclaves evaluated against threats studied by Kurt Rohloff and Amit Sahai.

Applications and Use Cases

Adoption scenarios include privacy-preserving analytics by Google LLC, secure auctions in contexts like Federal Communications Commission spectrum assignments, financial data aggregation used by Goldman Sachs and J.P. Morgan Chase, genomic data sharing among institutions like Broad Institute and Wellcome Sanger Institute, and voting systems considered by Estonia and studied by National Institute of Standards and Technology. Other domains include supply-chain coordination with firms like Siemens and DHL, collaborative machine learning in initiatives by OpenAI and Hugging Face, and healthcare collaborations involving Mayo Clinic and Johns Hopkins Hospital.

Practical Challenges and Implementations

Performance, scalability, and trust assumptions remain active problems addressed by engineers at NVIDIA, Intel Corporation, ARM Limited, Amazon Web Services, and Google Cloud Platform. Implementations have been field-tested by startups such as Zama and Partisia and academic prototypes from ETH Zurich, University of Oxford, Cambridge University, and Delft University of Technology. Side-channel risks and hardware enclave debates involve reports from Intel, AMD, and security audits by Kaspersky Lab and Mandiant. Standardization and interoperability efforts occur within IETF, ISO, and working groups influenced by W3C and IEEE.

Legal, Ethical, and Economic Considerations

Regulatory and compliance contexts implicate laws and bodies such as the General Data Protection Regulation, Health Insurance Portability and Accountability Act, European Data Protection Board, U.S. Department of Health and Human Services, Federal Trade Commission, and trade agreements like the WTO frameworks. Ethical debates are informed by institutions including UNESCO, World Economic Forum, The Hastings Center, and Pew Research Center. Economic incentives and market structures consider actors like McKinsey & Company, Boston Consulting Group, venture funding from Sequoia Capital and Andreessen Horowitz, and procurement policies of European Commission and U.S. General Services Administration.

Category:Cryptography