The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
Open accessAbstract
Ridge regression is an algorithm that takes as input a large number of data points and finds the best-fit linear curve through these points. The algorithm is a building block for many machine-learning operations. We present a system for privacy-preserving ridge regression. The system outputs the best-fit curve in the clear, but exposes no other information about the input data. Our approach combines both homomorphic encryption and Yao garbled circuits, where each is used in a different part of the algorithm to obtain the best performance. We implement the complete system and experiment with it on real data-sets, and show that it significantly outperforms pure implementations based only on homomorphic encryption or Yao circuits.
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,387
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
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
Numerical Recipes: The Art of Scientific Computing
Ziegel, E. (1987) · Technometrics · doi:10.1080/00401706.1987.10488304 · Cited by 6,702
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
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
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
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Rounding errors in algebraic processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90390-4 · Cited by 1,315
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_19 · Cited by 1,152
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Can homomorphic encryption be practical?
Naehrig, M., Lauter, K., & Vaikuntanathan, V. (2011) · Proceedings of the 3rd ACM workshop on Cloud computing security workshop · doi:10.1145/2046660.2046682 · Cited by 1,004
How to Exchange Secrets with Oblivious TransferPreprint
Rabin, M. O. (1981) · IACR Cryptology ePrint Archive · Cited by 870
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
Secure 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
Privacy Preserving Data Mining
Lindell, & Pinkas (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0019-2 · Cited by 668
Differentially private recommender systems: Building privacy into the Netflix Prize contenders
McSherry, F., & Mironov, I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557090 · Cited by 664
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
Differential privacy and robust statistics
Dwork, C., & Lei, J. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536466 · Cited by 611
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
Untraceable Off-line Cash in Wallet with Observers
Brands, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_26 · Cited by 507
Collaborative filtering with privacy
Canny, J. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004361 · Cited by 442
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
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
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
Huang, Y., Evans, D., & Katz, J. I. (2012) · Cited by 301
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Camenisch, J., & Michels, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_8 · Cited by 299
Communication complexity of secure computation (extended abstract)
Franklin, M., & Yung, M. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129780 · Cited by 268
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
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
Privacy-Preserving SVM Classification on Vertically Partitioned Data
Yu, H., Vaidya, J., & Jiang, X. (2006) · Lecture Notes in Computer Science · doi:10.1007/11731139_74 · Cited by 192
Efficient Privacy-Preserving Biometric Identification
Huang, Y., Malka, L., Evans, D., & Katz, J. I. (2011) · Cited by 181
Privacy-preserving cooperative scientific computations
Du, W., & Atallah, M. J. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930152 · Cited by 166
Efficiency Tradeoffs for Malicious Two-Party Computation
Mohassel, P., & Franklin, M. (2006) · Lecture notes in computer science · doi:10.1007/11745853_30 · Cited by 154
Privacy preserving regression modelling via distributed computation
Sanil, A. P., Karr, A. F., Lin, X., & Reiter, J. P. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014139 · Cited by 147
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Lindell, Y., Benny Pinkas, B., & Smart, N. P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85855-3_2 · Cited by 142
Privacy-Preserving Data Mining
Sammut, C., & Webb, G. I. (2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100375 · Cited by 140
Secure Regression on Distributed Databases
Karr, A. F., Lin, X., Sanil, A. P., & Reiter, J. P. (2005) · Journal of Computational and Graphical Statistics · doi:10.1198/106186005x47714 · Cited by 128
Privacy Preserving Analysis of Vertically Partitioned Data Using Secure Matrix Products
Karr, A. F., Karr, A. F., Lin, X., Lin, X., Reiter, J. P., & Sanil, A. P. (2004) · Cited by 113
Secure multiple linear regression based on homomorphic encryption
Hall, R., Fienberg, S. E., & Nardi, Y. (2011) · Cited by 109
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution
Huang, Y., Katz, J., & Evans, D. (2012) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2012.43 · Cited by 102
Secure, Privacy-Preserving Analysis of Distributed Databases
Karr, A. F., Fulp, W. J., Vera, F., et al. (2007) · Technometrics · doi:10.1198/004017007000000209 · Cited by 70
Damgård, I., & Jurik, M. J. (2000) · BRICS Report Series · doi:10.7146/brics.v7i45.20212 · Cited by 60
Privacy-preserving Data Mining
Yin, Y., Kaku, I., Tang, J., & Zhu, J. (2011) · Decision engineering · doi:10.1007/978-1-84996-338-1_6 · Cited by 58
Proofs of partial knowledge and simplified design of witness hiding protocols
Cramer, R., Damgård, I., & Schoenmakers, L. B. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 56
L1 - 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
Differentially private recommender systems
McSherry, F., & Mironov, I. (2009) · Cited by 16
Cited by
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
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
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
A survey on federated learning
Zhang, C., Xie, Y., Bai, H., Yu, B., Li, W., & Gao, Y. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106775 · Cited by 1,899
A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407
Metadata
- Authors
- Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., & Taft, N.
- Venue
- 2013 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2013-05
- Pages
- 334-348
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1971991172
- Cited by
- 439
- References
- 59
- FWCI
- 12.14
- 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
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.