The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Abstract
Author(s): Daniel Demmler, Thomas Schneider, Michael Zohner Download: Paper (PDF) Date: 7 Feb 2015 Document Type: Briefing Papers Additional Documents: Slides Associated Event: NDSS Symposium 2015 Abstract: Secure computation enables multiple mutually distrusting parties to jointly evaluate functions on their private inputs without revealing anything but the result. Generic secure computation protocols in the semi-honest … Continued
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
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
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
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
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Efficient Multiparty Protocols Using Circuit Randomization
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_34 · Cited by 893
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Privacy preserving auctions and mechanism design
Naor, M., Pinkas, B., & Sumner, R. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337028 · Cited by 753
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
Self-citationSecure Two-Party Computation Is Practical
Pinkas, B., Schneider, T., Smart, N. P., & Williams, S. C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_15 · Cited by 711
Self-citationSharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Efficient oblivious transfer protocols
Naor, M., & Benny Pinkas, B. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365502 · Cited by 614
Privacy-Preserving Face Recognition
Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., & Toft, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03168-7_14 · Cited by 583
Faster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40203-6_1 · Cited by 458
Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_15 · Cited by 443
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., & Taft, N. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.30 · Cited by 439
How to play any mental game, or a completeness theorem for protocols with honest majority
Technion, Goldreich, O., Micali, S., MIT, Wigderson, A., & Hebrew University (2019) · Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali · doi:10.1145/3335741.3335755 · Cited by 403
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
More efficient oblivious transfer and extensions for faster secure computation
Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516738 · Cited by 358
Self-citationEfficient 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
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
Huang, Y., Evans, D., & Katz, J. I. (2012) · Cited by 301
Privacy-preserving matrix factorization
Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., & Boneh, D. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516751 · Cited by 271
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Kolesnikov, V., Sadeghi, A.-R., & Schneider, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10433-6_1 · Cited by 263
Self-citationAsynchronous Multiparty Computation: Theory and Implementation
Damgård, I., Geisler, M., Krøigaard, M., & Nielsen, J. B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_10 · Cited by 251
Faster Private Set Intersection based on OT Extension.Preprint
Benny Pinkas, B., Schneider, T. H., & Zohner, M. (2014) · IACR Cryptology ePrint Archive · Cited by 236
Self-citationCorrelated pseudorandomness and the complexity of private computations
Beaver, D. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237996 · Cited by 233
Homomorphic encryption and secure comparison
Damgard, I., Geisler, M., & Kroigard, M. (2008) · International Journal of Applied Cryptography · doi:10.1504/ijact.2008.017048 · Cited by 221
Secure Computation with Fixed-Point Numbers
Catrina, O., & Saxena, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14577-3_6 · Cited by 214
A generalization of Paillier’s public-key system with applications to electronic voting
Damgård, I., Jurik, M., & Nielsen, J. B. (2010) · International Journal of Information Security · doi:10.1007/s10207-010-0119-9 · Cited by 208
Gilboa, N. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_8 · Cited by 189
Efficient Privacy-Preserving Biometric Identification
Huang, Y., Malka, L., Evans, D., & Katz, J. I. (2011) · Cited by 181
Improved Primitives for Secure Multiparty Integer Computation
Catrina, O., & de Hoogh, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15317-4_13 · Cited by 178
Secure and Efficient Protocols for Iris and Fingerprint Identification
Blanton, M., & Gasti, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23822-2_11 · Cited by 168
Privacy-preserving remote diagnostics
Brickell, J., Porter, D. E., Shmatikov, V., & Witchel, E. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315307 · Cited by 158
Private collaborative forecasting and benchmarking
Atallah, M. J., Bykova, M., Li, J., Frikken, K. B., & Topkara, M. (2004) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1029179.1029204 · Cited by 153
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A., & Schneider, T. H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04444-1_26 · Cited by 144
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
Secure two-party computations in ANSI C
Holzer, A., Franz, M., Katzenbeisser, S., & Veith, H. (2012) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2382196.2382278 · Cited by 125
GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
Schneider, T. H., & Zohner, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39884-1_23 · Cited by 112
Self-citationEfficient Binary Conversion for Paillier Encrypted Values
Schoenmakers, B., & Tuyls, P. (2006) · Lecture notes in computer science · doi:10.1007/11761679_31 · Cited by 109
Choi, S. G., Hwang, K.-W., Katz, J. I., Malkin, T., & Rubenstein, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27954-6_26 · Cited by 102
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
Mohassel, P., & Sadeghian, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_33 · Cited by 99
An architecture for practical actively secure MPC with dishonest majority
Keller, M., Schöll, P., & Smart, N. P. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516744 · Cited by 88
Fast two-party secure computation with minimal assumptions
Shelat, A. A., & Shen, C.-H. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516698 · Cited by 87
Dishonest Majority Multi-Party Computation for Binary Circuits
Larraia, E., Orsini, E., & Smart, N. P. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44381-1_28 · Cited by 66
Automatic Protocol Selection in Secure Two-Party Computations
Kerschbaum, F., Schneider, T. H., & Schröpfer, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07536-5_33 · Cited by 49
Self-citationL1 - An Intermediate Language for Mixed-Protocol Secure Computation
Schröpfer, A., Kerschbaum, F., & Müller, G. (2011) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac.2011.46 · Cited by 47
Cryptographic Protocols:: Theory and Implementation
Geisler, M. (2010) · Cited by 45
Automatically optimizing secure computation
Kerschbaum, F. (2011) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2046707.2046786 · Cited by 42
Domain-Polymorphic Programming of Privacy-Preserving Applications
Bogdanov, D., Laud, P., & Randmets, J. (2014) · ACM Workshop on Programming Languages and Analysis for Security · doi:10.1145/2637113.2637119 · Cited by 38
Kolesnikov, V., Sadeghi, A., & Schneider, T. H. (2013) · Journal of Computer Security · doi:10.3233/jcs-130464 · Cited by 36
Self-citationBetween a Rock and a Hard Place: Interpolating between MPC and FHE
Choudhury, A., Loftus, J., Orsini, E., Patra, A., & Smart, N. P. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42045-0_12 · Cited by 32
Cited by
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936
Oblivious Neural Network Predictions via MiniONN Transformations
Liu, J., Juuti, M., Lu, Y., & Asokan, N. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134056 · Cited by 691
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548
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
SecureNN: 3-Party Secure Computation for Neural Network Training
Wagh, S., Gupta, D., & Chandran, N. (2019) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2019-0035 · Cited by 413
Metadata
- Authors
- Demmler, D., Schneider, T., & Zohner, M.
- Venue
- Proceedings 2015 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2015
- OpenAlex
- W1969009977
- Cited by
- 827
- References
- 55
- FWCI
- 20.07
- 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.