The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Machine Learning Classification over Encrypted Data
Abstract
Machine learning classification is used in numerous settings nowadays, such as medical or genomics predictions, spam detection, face recognition, and financial predictions.Due to privacy concerns, in some of these applications, it is important that the data and the classifier remain confidential.In this work, we construct three major classification protocols that satisfy this privacy constraint: hyperplane decision, Naïve Bayes, and decision trees.We also enable these protocols to be combined with AdaBoost.At the basis of these constructions is a new library of building blocks for constructing classifiers securely; we demonstrate that this library can be used to construct other classifiers as well, such as a multiplexer and a face detection classifier.We implemented and evaluated our library and classifiers.Our protocols are efficient, taking milliseconds to a few seconds to perform a classification when running on real medical datasets.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,387
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
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
Fully 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
Pattern Recognition and Machine Learning
Neal, R. M. (2007) · Technometrics · doi:10.1198/tech.2007.s518 · Cited by 4,571
Goldreich, 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
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
Random Features for Large-Scale Kernel Machines
Rahimi, A., & Recht, B. (2007) · Cited by 2,783
(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
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
(2011) · PubMed · Cited by 990
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Fully homomorphic SIMD operations
Smart, N. P., & Vercauteren, F. (2014) · Designs, Codes and Cryptography · doi:10.1007/s10623-012-9720-4 · Cited by 656
A Proof of Security of Yao’s Protocol for Two-Party Computation
Lindell, Y., & Pinkas, B. (2009) · Journal of Cryptology · doi:10.1007/s00145-008-9036-8 · Cited by 651
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
Secure Multiparty Computation for Privacy-Preserving Data Mining
Lindell, Y., & Pinkas, B. (2009) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i1.566 · Cited by 554
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
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
ML Confidential: Machine Learning on Encrypted Data
Graepel, T., Lauter, K., & Naehrig, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37682-5_1 · Cited by 423
On Private Scalar Product Computation for Privacy-Preserving Data Mining
Goethals, B., Laur, S., Lipmaa, H., & Mielikäinen, T. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496618_9 · Cited by 370
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Du, W., Han, Y. S., & Chen, S. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.21 · Cited by 366
Efficient Privacy-Preserving Face Recognition
Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14423-3_16 · Cited by 363
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
Private predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · cited 2×
“The few works on privacy-preserving classification either consider a weaker security setting in which the client learns the model [16] or focus on specific classifiers (e.”
BackgroundSecure Multi-party Computational Geometry
Atallah, M. J., & Du, W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44634-6_16 · Cited by 234
Privacy-preserving Bayesian network structure computation on distributed heterogeneous data
Wright, R., & Yang, Z. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014145 · Cited by 219
Privacy-Preserving Classification of Customer Data without Loss of Accuracy
Yang, Z., Zhong, S., & Wright, R. N. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.9 · Cited by 206
An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
Lin, H.-Y., & Tzeng, W.-G. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_31 · Cited by 206
Privacy-preserving Naïve Bayes classification
Vaidya, J., Kantarcıoğlu, M., & Clifton, C. (2008) · The VLDB Journal · doi:10.1007/s00778-006-0041-y · Cited by 202
Efficient and Secure Comparison for On-Line Auctions
Damgård, I., Geisler, M., & Krøigaard, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73458-1_30 · Cited by 199
Privacy-Preserving ECG Classification With Branching Programs and Neural Networks
Barni, M., Failla, P., Lazzeretti, R., Sadeghi, A.-R., & Schneider, T. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2108650 · Cited by 194
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
Cryptographically private support vector machines
Laur, S., Lipmaa, H., & Mielikäinen, T. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150477 · Cited by 137
Security and Composition of Multi-party Cryptographic Protocols.
Canetti, R. (1998) · Cited by 81
Kolesnikov, V., Sadeghi, A., & Schneider, T. H. (2013) · Journal of Computer Security · doi:10.3233/jcs-130464 · Cited by 36
Efficient Methods for Privacy Preserving Face Detection
Avidan, S., & Butman, M. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0012 · Cited by 29
Bayesian Network Classifiers with Reduced Precision Parameters
Tschiatschek, S., Reinprecht, P., Mücke, M., & Pernkopf, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33460-3_10 · Cited by 15
Cited by
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210
Salem, A., Zhang, Y., Humbert, M., Berrang, P., Fritz, M., & Backes, M. (2019) · Proceedings 2019 Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23119 · Cited by 852
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
SecureBoost: A Lossless Federated Learning Framework
Cheng, K., Fan, T., Jin, Y., Liu, Y., Chen, T., Papadopoulos, D., & Yang, Q. (2019) · arXiv · doi:10.48550/arxiv.1901.08755 · Cited by 668
Machine Learning Models that Remember Too Much
Song, C., Ristenpart, T., & Shmatikov, V. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134077 · Cited by 526
Metadata
- Authors
- Bost, R., Popa, R. A., Tu, S., & Goldwasser, S.
- Venue
- Proceedings 2015 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2015
- OpenAlex
- W2031738616
- Cited by
- 674
- References
- 39
- FWCI
- 30.87
- 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.