The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Secure multiparty computation
Abstract
MPC has moved from theoretical study to real-world usage. How is it doing?
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
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
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
The round complexity of secure protocols
Beaver, D., Micali, S., & Rogaway, P. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100287 · Cited by 721
Founding Cryptography on Oblivious Transfer – Efficiently
Ishai, Y., Prabhakaran, M., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_32 · Cited by 460
Limits on the security of coin flips when half the processors are faulty
Cleve, R. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12168 · Cited by 451
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Lindell, Y., & Pinkas, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72540-4_4 · Cited by 427
Self-citationA 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
A Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000019 · Cited by 321
Scalable Private Set Intersection Based on OT Extension
Pinkas, B., Schneider, T., & Zohner, M. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3154794 · Cited by 313
Scalable and Unconditionally Secure Multiparty Computation
Damgård, I., & Nielsen, J. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_32 · Cited by 270
Fast Multiparty Threshold ECDSA with Fast Trustless Setup
Gennaro, R., & Goldfeder, S. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243859 · Cited by 247
Perfectly-Secure MPC with Linear Communication Complexity
Beerliová-Trubíniová, Z., & Hirt, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_13 · Cited by 222
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Aumann, Y., & Lindell, Y. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9040-7 · Cited by 205
Self-citationA Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680835090 · Cited by 204
Fast Secure Two-Party ECDSA Signing
Lindell, Y. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0_21 · Cited by 181
Self-citationThreshold ECDSA from ECDSA Assumptions: The Multiparty Case
Doerner, J., Kondi, Y., Lee, E., & Shelat, A. (2019) · IEEE Symposium on Security and Privacy · doi:10.1109/sp.2019.00024 · Cited by 176
SoK: General Purpose Compilers for Secure Multi-Party Computation
Hastings, M., Hemenway, B., Noble, D., & Zdancewic, S. (2019) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2019.00028 · Cited by 162
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
Chida, K., Genkin, D., Hamada, K., Ikarashi, D., Kikuchi, R., Lindell, Y., & Nof, A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_2 · Cited by 144
Self-citationMaintaining Security in the Presence of Transient Faults
Canetti, R., & Herzberg, A. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_38 · Cited by 106
Lapets, A., Jansen, F., Albab, K. D., Issa, R., Qin, L., Varia, M., & Azer Bestavros, C. (2018) · ACM SIGCAS Conference on Computing and Sustainable Societies (COMPASS) · doi:10.1145/3209811.3212701 · Cited by 40
Cited by
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
Privacy preservation in federated learning: An insightful survey from the GDPR perspective
Truong, N., Sun, K., Wang, S., Guitton, F., & Guo, Y. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102402 · Cited by 399
Privacy preserving and secure robust federated learning: A survey
Han, Q., Lu, S., Wang, W., Qu, H., Li, J., & Gao, Y. (2024) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.8084 · Cited by 29
Security, privacy, and trust management in DNA computing
Fernandes, M., Decouchant, J., & Couto, F. M. (2023) · Advances in Computers · doi:10.1016/bs.adcom.2022.08.009 · Cited by 3
Metadata
- Authors
- Lindell, Y.
- Venue
- Communications of the ACM
- Published
- 2020-12-17
- Volume
- 64
- Issue
- 1
- Pages
- 86-96
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W3026923845
- Cited by
- 320
- References
- 26
- FWCI
- 9.28
- Type
- journal article
- 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.