Privacy-preserving ridge regression on hundreds of millions of records

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2013, Pages 334-348

  Nikolaenko, Valeria ^a   Weinsberg, Udi ^b   Ioannidis, Stratis ^b   Joye, Marc ^b   Boneh, Dan ^a   Taft, Nina ^b  

^a STANFORD UNIVERSITY   (United States)

^b Technicolor ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; COMPLETE SYSTEM; GARBLED CIRCUITS; HO-MOMORPHIC ENCRYPTIONS; MACHINE-LEARNING; NUMBER OF DATUM; PRIVACY PRESERVING; RIDGE REGRESSION;

ALGORITHMS; CRYPTOGRAPHY;

REGRESSION ANALYSIS;

EID: 84881255209     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2013.30     Document Type: Conference Paper

References (56)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in ACM STOC, 1988.
2. C. Gentry, "Fully homomorphic encryption using ideal lattices," in ACM STOC, 2009.
3. A. C.-C. Yao, "How to generate and exchange secrets," in IEEE Annual Symposium on Foundations of Computer Science (FOCS), 1986.
4. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Advances in Cryptology - EUROCRYPT '99. Springer, 1999.
5. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," J. ACM, vol. 56, no. 6, 2009.
6. Y. Huang, D. Evans, J. Katz, and L. Malka, "Faster secure two-party computation using garbled circuits," in 20th USENIX Security Symposium. USENIX Association, 2011.
7. UCI, "Machine Learning Repository." [Online]. Available: http://archive.ics.uci.edu/ml/datasets.html
8. R. Hall, S. E. Fienberg, and Y. Nardi, "Secure multiple linear regression based on homomorphic encryption," J. Official Statistics, vol. 27, no. 4, 2011.
9. Y. Aumann and Y. Lindell, "Security against covert adversaries: Efficient protocols for realistic adversaries," J. Cryptology, vol. 23, no. 2, 2010.
10. M. K. Franklin and M. Yung, "Communication complexity of secure computation," in ACM STOC, 1992.
11. J. Friedman, T. Hastie, and R. Tibshirani, The Elements of Statistical Learning: Data Mining, Inference and Prediction, 2nd ed. Springer, 2009.
12. Y. Lindell and B. Pinkas, "A proof of security of Yao's protocol for two-party computation," J. Cryptology, vol. 22, no. 2, 2009.
13. M. O. Rabin, "How to exchange secrets by oblivious transfer," Harvard University, Tech. Rep. TR-81, 1981.
14. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts," Commun. ACM, vol. 28, no. 6, 1985.
15. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay - Secure two-party computation system," in 13th USENIX Security Symposium. USENIX Association, 2004.
16. M. Naor, B. Pinkas, and R. Sumner, "Privacy preserving auctions and mechanism design," in 1st ACM Conference on Electronic Commerce. ACM Press, 1999.
17. I. Damgård and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system," in Public-Key Cryptography - PKC 2001. Springer, 2001.
18. T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in CRYPTO'91, 1992.
19. J. Camenisch and M. Michels, "Proving in zero-knowledge that a number is the product of two safe primes," in Advances in Cryptology - EUROCRYPT '99. Springer, 1999.
20. S. Brands, "Untraceable off-line cash in wallets with observers," in CRYPTO'93. Springer, 1994.
21. R. Cramer, I. Damgård, and B. Schoenmakers, "Proofs of partial knowledge and simplified design of witness hiding protocols," in CRYPTO'94. Springer, 1994.
22. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," in CRYPTO'86. Springer, 1987.
23. R. Gennaro, C. Gentry, and B. Parno, "Non-interactive verifiable computing: Outsourcing computation to untrusted workers," in CRYPTO 2010. Springer, 2010.
24. V. Kolesnikov and T. Schneider, "Improved garbled circuit: Free XOR gates and applications," in Automata, Languages and Programming (ICALP). Springer, 2008.
25. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams, "Secure two-party computation is practical," in Advances in Cryptology - ASIACRYPT 2009. Springer, 2009.
26. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank, "Extending oblivious transfers efficiently," in CRYPTO 2003. Springer, 2003.
27. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider, "Improved garbled circuit building blocks and applications to auctions and computing minima," in Cryptology and Network Security (CANS). Springer, 2009.
28. W. Henecka, S. K. ögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, "TASTY: tool for automating secure two-party computations," in 17th ACM Conference on Computer and Communications Security (CCS). ACM Press, 2010.
29. A. Schropfer, F. Kerschbaum, and G. Muller, "L1 - an intermediate language for mixed-protocol secure computation," in 35th Annual Computer Software and Applications Conference (COMPSAC). IEEE Computer Society, 2011.
30. Y. Huang, J. Katz, and D. Evans, "Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution," in IEEE Symposium on Security and Privacy, 2012.
31. B. Kreuter, A. Shelat, and C.-H. Shen, "Billion-gate secure computation with malicious adversaries," in 21st USENIX Security Symposium. USENIX Association, 2012.
32. Y. Lindell, B. Pinkas, and N. P. Smart, "Implementing two-party computation efficiently with security against malicious adversaries," in Security and Cryptography for Networks (SCN). Springer, 2008.
33. P. Mohassel and M. Franklin, "Efficiency tradeoffs for malicious two-party computation," in Public-Key Cryptography (PKC). Springer, 2006.
34. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes: The Art of Scientific Computing, 3rd ed. Cambridge University Press, 2007.
35. T. Graepel, K. Lauter, and M. Naehrig, "ML confidential: Machine learning on encrypted data," Cryptology ePrint Archive, Report 2012/323, 2012.
36. F. G. Gustavson and I. Jonsson, "Minimal-storage high-performance Cholesky factorization via blocking and recursion," IBM J. Res. Dev., vol. 44, 2000.
37. J. H. Wilkinson, Rounding Errors in Algebraic Processes. Prentice Hall, 1963.
38. D. E. Knuth, The Art of Computer Programming, Vol. 2, Semuninumerical Algorithms, 3rd ed. Addison-Wesley, 1997.
39. J. W. Crenshaw, "Integer square roots," Embedded Systems Programming, Feb. 1998.
40. A. P. Sanil, A. F. Karr, X. Lin, and J. P. Reiter, "Privacy preserving regression modelling via distributed computation," in ACM KDD, 2004.
41. H. Yu, J. Vaidya, and X. Jiang, "Privacy-preserving SVM classification on vertically partitioned data," in Advances in Knowledge Discovery and Data Mining (PAKDD), 2006.
42. W. Du and M. J. Atallah, "Privacy-preserving cooperative scientific computations," in 14th IEEE Computer Security Foundations Workshop (CSFW-14). IEEE Computer Society, 2001.
43. W. Du, Y. S. Han, and S. Chen, "Privacy-preserving multivariate statistical analysis: Linear regression and classification," in 4th SIAM International Conference on Data Mining (SDM 2004). SIAM, 2004.
44. J. Vaidya, C. W. Clifton, and Y. M. Zhu, Privacy Preserving Data Mining. Springer, 2006.
45. A. F. Karr, X. Lin, A. P. Sanil, and J. P. Reiter, "Secure regression on distributed databases," J. Computational and Graphical Statistics, vol. 14, no. 2, 2005.
46. A. F. Karr, W. J. Fulp, F. Vera, S. S. Young, X. Lin, and J. P. Reiter, "Secure, privacy-preserving analysis of distributed databases," Technometrics, vol. 49, no. 3, 2007.
47. A. F. Karr, X. Lin, A. P. Sanil, and J. P. Reiter, "Privacy- preserving analysis of vertically partitioned data using secure matrix products," J. Official Statistics, vol. 25, no. 1, 2009.
48. J. F. Canny, "Collaborative filtering with privacy," in IEEE Symposium on Security and Privacy, 2002.
49. Y. Huang, D. Evans, and J. Katz, "Private set intersection: Are garbled circuits better than custom protocols?" in Network and Distributed System Security Symposium (NDSS). The Internet Society, 2012.
50. K. Lauter, M. Naehrig, and V. Vaikuntanathan, "Can homomorphic encryption be practical?" in 3rd ACM Cloud Computing Security Workshop (CCSW). ACM Press, 2011.
51. A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, "Efficient privacy-preserving face recognition," in Information, Security and Cryptology - ICISC 2009. Springer, 2010.
52. Y. Huang, L. Malka, D. Evans, and J. Katz, "Efficient privacy-preserving biometric identification," in Network and Distributed System Security Symposium (NDSS 2011). The Internet Society, 2011.
53. Y. Lindell and B. Pinkas, "Privacy preserving data mining," J. Cryptology, vol. 15, no. 3, 2002.
54. C. Dwork, "Differential privacy," in Automata, Languages and Programming (ICALP). Springer, 2006.
55. C. Dwork and J. Lei, "Differential privacy and robust statistics," in ACM STOC, 2009.
56. F. McSherry and I. Mironov, "Differentially private recommender systems: Building privacy into the Netflix prize contenders," in ACM KDD, 2009.