The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
MP-SPDZ: A Versatile Framework for Multi-Party Computation
Abstract
Multi-Protocol SPDZ (MP-SPDZ) is a fork of SPDZ-2 (Keller et al., CCS '13), an implementation of the multi-party computation (MPC) protocol called SPDZ (Damgård et al., Crypto '12). MP-SPDZ extends SPDZ-2 to 30 MPC protocol variants, all of which can be used with the same high-level programming interface based on Python. This considerably simplifies comparing the cost of different protocols and security models. The protocols cover all commonly used security models (honest/dishonest majority and semi-honest/malicious corruption) as well as computation of binary and arithmetic circuits (the latter modulo primes and powers of two). The underlying primitives employed include secret sharing, oblivious transfer, homomorphic encryption, and garbled circuits. The breadth of implemented protocols coupled with an accessible high-level interface makes it suitable to benchmark the cost of computation in various security models for researchers both with and without a background in secure computation This paper aims to outline the variety of protocols implemented and the design choices made in the development of MP-SPDZ as well as the capabilities of the programming interface.
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
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
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
Path ORAM: an extremely simple oblivious RAM protocol
Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., & Devadas, S. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516660 · Cited by 698
ABY 3: A Mixed Protocol Framework for Machine Learning
Mohassel, P., & Rindal, P. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243760 · Cited by 432
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
Keller, M., Orsini, E., & Scholl, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978357 · Cited by 411
Self-citationHigh-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Araki, T., Furukawa, J., Lindell, Y., Nof, A., & Ohara, K. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978331 · Cited by 405
A New Approach to Practical Active-Secure Two-Party Computation
Nielsen, J. B., Nordholt, P. S., Orlandi, C., & Burra, S. S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_40 · Cited by 379
Efficient Garbling from a Fixed-Key Blockcipher
Bellare, M., Hoang, V. T., Keelveedhi, S., & Rogaway, P. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.39 · Cited by 304
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
Cramer, R., Damgård, I., & Ishai, Y. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_19 · Cited by 217
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
Furukawa, J., Lindell, Y., Nof, A., & Weinstein, O. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56614-6_8 · Cited by 153
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits
Escudero, D. E., Ghosh, S., Keller, M., Rachuri, R., & Schöll, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_29 · Cited by 137
Self-citationWysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations
Rastogi, A., Hammer, M. A., & Hicks, M. (2014) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2014.48 · Cited by 134
Lindell, Y., & Nof, A. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3133999 · Cited by 96
A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
Bogetoft, P., Damgård, I., Jakobsen, T. P., Nielsen, K., Pagter, J. I., & Toft, T. (2006) · Lecture notes in computer science · doi:10.1007/11889663_10 · Cited by 94
Zhang, Y., Steele, A., & Blanton, M. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516752 · Cited by 86
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
Hazay, C., Schöll, P., & Soria-Vázquez, E. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70694-8_21 · Cited by 82
HyCC: Compilation of Hybrid Protocols for Practical Secure Computation
Büscher, N., Demmler, D., Katzenbeisser, S., Kretzmer, D., & Schneider, T. H. (2018) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3243734.3243786 · Cited by 73
A Unified Approach to MPC with Preprocessing Using OT
Frederiksen, T. K., Keller, M., Orsini, E., & Schöll, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48797-6_29 · Cited by 57
Self-citationEfficient Maliciously Secure Multiparty Computation for RAM
Keller, M., & Yanai, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78372-7_4 · Cited by 37
Self-citationCompiling Low Depth Circuits for Practical Secure Computation
Büscher, N., Holzer, A., Weber, A., & Katzenbeisser, S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45741-3_5 · Cited by 32
Cited by
ShieldFL: Mitigating Model Poisoning Attacks in Privacy-Preserving Federated Learning
Ma, Z., Ma, J., Miao, Y., Li, Y., & Deng, R. H. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3169918 · Cited by 371
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
CrypTFlow: Secure TensorFlow Inference
Kumar, N., Rathee, M., Chandran, N., Gupta, D., Rastogi, A., & Sharma, R. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00092 · Cited by 245
POSEIDON: Privacy-Preserving Federated Neural Network Learning
Sav, S., Pyrgelis, A., Troncoso-Pastoriza, J. R., Froelicher, D., Bossuat, J.-P., Sousa, J. S., & Hubaux, J.-P. (2021) · Proceedings 2021 Network and Distributed System Security Symposium · doi:10.14722/ndss.2021.24119 · Cited by 162
Privacy-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
Metadata
- Authors
- Keller, M.
- Venue
- Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2020-10-30
- Volume
- 2020
- Pages
- 1575-1590
- OpenAlex
- W3030820238
- Cited by
- 496
- References
- 21
- FWCI
- 20.86
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.