SoK: General Purpose Compilers for Secure Multi-Party Computation
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Secure multi-party computation (MPC) allows a group of mutually distrustful parties to compute a joint function on their inputs without revealing any information beyond the result of the computation. This type of computation is extremely powerful and has wide-ranging applications in academia, industry, and government. Protocols for secure computation have existed for decades, but only recently have general-purpose compilers for executing MPC on arbitrary functions been developed. These projects rapidly improved the state of the art, and began to make MPC accessible to non-expert users. However, the field is changing so rapidly that it is difficult even for experts to keep track of the varied capabilities of modern frameworks. In this work, we survey general-purpose compilers for secure multi-party computation. These tools provide high-level abstractions to describe arbitrary functions and execute secure computation protocols. We consider eleven systems: EMP-toolkit, Obliv-C, ObliVM, TinyGarble, SCALE-MAMBA (formerly SPDZ), Wysteria, Sharemind, PICCO, ABY, Frigate and CBMC-GC. We evaluate these systems on a range of criteria, including language expressibility, capabilities of the cryptographic back-end, and accessibility to developers. We advocate for improved documentation of MPC frameworks, standardization within the community, and make recommendations for future directions in compiler development. Installing and running these systems can be challenging, and for each system, we also provide a complete virtual environment (Docker container) with all the necessary dependencies to run the compiler and our example programs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“Cryptographic secret sharing protocols [116], [20] allow a dealer to break a secret value into shares and distribute these shares to group of recipients with the”
BackgroundFully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“Fully homomorphic encryption [66] provides an alternative method for securely computing functions encoded as arithmetic circuits.”
MethodGoldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
A Tool for Checking ANSI-C Programs
Clarke, E., Kroening, D., & Lerda, F. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24730-2_15 · Cited by 1,408
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331 · cited 1×
“SCALE implements a two-phase protocol which offloads all public-key operations to an offline pre-processing phase, generates three types of shared randomness to use during protocol execution, and executes an optimized hybrid protocol based on previous work [18], [46], [103].”
MethodSecure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595 · cited 1×
“CCD [31] rely on secret-sharing schemes supporting strong multiplication [40], [33], [29], [41] rather than on public-key primitives.”
BackgroundPrivacy-preserving distributed linear regression on high-dimensional data
Gascón, A., Schoppmann, P., Balle, B., Raykova, M., Doerner, J., Zahur, S., & Evans, D. (2017) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2017-0053 · Cited by 193 · cited 2×
“Several groups have used Obliv-C to implement secure functionalities, including linear regression [62], decentralized certificate authorities [83], aggregated private machine-learning models [119], classification of encrypted emails [70] and stable matching [49].”
BackgroundMethodDeriving genomic diagnoses without revealing patient genomes
Jagadeesh, K. A., Wu, D. J., Birgmeier, J. A., Boneh, D., & Bejerano, G. (2017) · Science · doi:10.1126/science.aam9710 · Cited by 134
Realizing private and practical pharmacological collaboration
Hie, B., Cho, H., & Berger, B. (2018) · Science · doi:10.1126/science.aat4807 · Cited by 76
Cited by
Lindell, Y. (2021) · Communications of the ACM · doi:10.1145/3387108 · Cited by 320
CrypTen: Secure Multi-Party Computation Meets Machine Learning
Knott, B., Venkataraman, S., Hannun, A., Sengupta, S., Ibrahim, M., & van der Maaten, L. (2021) · arXiv · doi:10.48550/arxiv.2109.00984 · Cited by 257
“Most other secure MPC frameworks [34] adopt an API that stays close to the underlying MPC protocols.”
MethodSoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
“tation [82]–[85], zero-knowledge [86]–[89], and secure multiparty computation [90] protocols, which are parameterized by a proof-goal or a functionality to compute.”
BackgroundPrivacy-Preserving Deep Learning Based on Multiparty Secure Computation: A Survey
Zhang, Q., Xin, C., & Wu, H. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3058638 · Cited by 53
“These tools provide high-level abstractions to describe arbitrary functions and execute SMPC protocols, i.e., GC, OT, and SS [93], [94].”
BackgroundCOLLAGENE enables privacy-aware federated and collaborative genomic data analysis
Li, W., Kim, M., Zhang, K., Chen, H., Jiang, X., & Harmanci, A. (2023) · Genome Biology · doi:10.1186/s13059-023-03039-z · Cited by 16
“Two recent MPC-based efforts for directly compiling code to be runnable in MPC-based primitives (MPC-SoK [60]) and for building MPC-based pipelines (Sequre [61]) can benefit more advanced users because these approaches use specialized programming languages.”
Background
Metadata
- Authors
- Hastings, M., Hemenway, B., Noble, D., & Zdancewic, S.
- Venue
- 2019 IEEE Symposium on Security and Privacy (SP)
- Publisher
- IEEE
- Published
- 2019-05
- Pages
- 1220-1237
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2929650703
- Cited by
- 138
- References
- 11
- FWCI
- 7.31
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SoK: General Purpose Compilers for Secure Multi-Party Computation. https://app.cochat.ai/papers/10.1109/sp.2019.00028
- The paper
- Hastings, M., Hemenway, B., Noble, D., & Zdancewic, S. (2019). SoK: General Purpose Compilers for Secure Multi-Party Computation. 2019 IEEE Symposium on Security and Privacy (SP). https://doi.org/10.1109/sp.2019.00028
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.