Privacy-preserving matrix factorization

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 801-812

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

^a STANFORD UNIVERSITY   (United States)

^b Technicolor Inc   (United States)

Author keywords

garbled circuits; matrix factorization; multi party computation; privacy; recommender systems

Indexed keywords

COMMODITY HARDWARE; CRYPTOGRAPHIC TECHNIQUES; EFFICIENT IMPLEMENTATION; GARBLED CIRCUITS; MATRIX FACTORIZATIONS; MULTIPARTY COMPUTATION; OBLIVIOUS SORTING; PRIVACY PRESERVING;

DATA PRIVACY; RECOMMENDER SYSTEMS;

SECURITY OF DATA;

EID: 84888987660     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508859.2516751     Document Type: Conference Paper

References (63)

1. E. Aïmeur, G. Brassard, J. M. Fernandez, and F. S. M. Onana. ALAMBIC: A privacy-preserving recommender system for electronic commerce. Int. J. Inf. Sec., 7(5), 2008.
2. M. Ajtai, J. Komlós, and E. Szemerédi. An O (n log n) sorting network. In STOC, 1983.
3. K. E. Batcher. Sorting networks and their applications. In Proc. AFIPS Spring Joint Computer Conference, 1968.
4. M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In CRYPTO, 1990.
5. E. J. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 2009.
6. J. F. Canny. Collaborative filtering with privacy. In IEEE S&P, 2002.
7. B. Chevallier-Mames, P. Paillier, and D. Pointcheval. Encoding-free ElGamal encryption without random oracles. In PKC, 2006.
8. S. A. Cook and R. A. Reckhow. Time bounded random access machines. J. Computer and System Sciences, 1973.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
10. I. Damgård and T. Toft. Trading sugar beet quotas - secure multiparty computation in practice. ERCIM News, 2008.
11. W. Du and M. J. Atallah. Secure multi-party computation problems and their applications: A review and open problems. In New Security Paradigms Workshop, 2001.
12. C. Dwork. Differential privacy. In ICALP, 2006.
13. D. Eppstein, M. T. Goodrich, and R. Tamassia. Privacy-preserving data-oblivious geometric algorithms for geographic data. In 18th SIGSPATIAL, 2010.
14. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Commun. ACM, 28(6), 1985.
15. J. Friedman, T. Hastie, and R. Tibshirani. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2nd edition, 2009.
16. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, 2009.
17. S. Goldwasser and M. Bellare. Lecture Notes on Cryptography. MIT, 2001.
18. M. T. Goodrich. Randomized shellsort: A simple oblivious sorting algorithm. In SODA, 2010.
19. M. T. Goodrich. Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. In SPAA, 2011.
20. T. Graepel, K. Lauter, and M. Naehrig. ML confidential: Machine learning on encrypted data. Cryptology ePrint Archive, Report 2012/323, 2012.
21. R. Hall, S. E. Fienberg, and Y. Nardi. Secure multiple linear regression based on homomorphic encryption. J. Official Statistics, 2011.
22. K. Hamada, R. Kikuchi, D. Ikarashi, K. Chida, and K. Takahashi. Practically efficient multi-party sorting protocols from comparison sort algorithms. In ICISC, 2013.
23. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. TASTY: Tool for automating secure two-party computations. In CCS, 2010.
24. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security, 2011.
25. Y. Huang, J. Katz, and D. Evans. Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution. In IEEE S&P, 2012.
26. Y. Huang, L. Malka, D. Evans, and J. Katz. Efficient privacy-preserving biometric identification. In NDSS, 2011.
27. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO, 2003.
28. K. V. Jónsson, G. Kreitz, and M. Uddin. Secure multi-party sorting and applications. Cryptology ePrint Archive, Report 2011/122, 2011.
29. 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, 2007.
30. 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, 2009.
31. R. H. Keshavan, A. Montanari, and S. Oh. Learning low rank matrices from O (n) entries. In Allerton, 2008.
32. D. E. Knuth. The Art Of Computer Programming - Volume 3 / Sorting and Searching. Addison-Wesley, 2nd edition, 1998.
33. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS, 2009.
34. V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. In ICALP, 2008.
35. Y. Koren, R. M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 2009.
36. B. Kreuter, A. Shelat, and C.-H. Shen. Billion-gate secure computation with malicious adversaries. In USENIX Security, 2012.
37. S. K. Lam, D. Frankowski, and J. Riedl. Do you trust your recommendations? An exploration of security and privacy issues in recommender systems. In ETRICS 2006, 2006.
38. S. K. Lam and J. Riedl. Shilling recommender systems for fun and profit. In WWW, 2004.
39. K. Lauter, M. Naehrig, and V. Vaikuntanathan. Can homomorphic encryption be practical? In CCSW, 2011.
40. Y. Lindell. Fast cut-and-choose based protocols for malicious and covert adversaries. IACR Cryptology ePrint Archive, 2013.
41. Y. Lindell and B. Pinkas. Privacy preserving data mining. J. Cryptology, 2002.
42. Y. Lindell and B. Pinkas. A proof of security of Yao's protocol for two-party computation. J. Cryptology, 2009.
43. Y. Lindell and B. Pinkas. Secure two-party computation via cut-and-choose oblivious transfer. J. Cryptology, 2012.
44. Y. Lindell, B. Pinkas, and N. P. Smart. Implementing two-party computation efficiently with security against malicious adversaries. In SCN, 2008.
45. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - Secure two-party computation system. In USENIX Security, 2004.
46. F. McSherry and I. Mironov. Differentially private recommender systems: Building privacy into the Netflix prize contenders. In KDD, 2009.
47. B. Mobasher, R. Burke, R. Bhaumik, and C. Williams. Toward trustworthy recommender systems: An analysis of attack models and algorithm robustness. ACM Trans. Internet Techn., 7(4), 2007.
48. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In 1st ACM Conference on Electronic Commerce, 1999.
49. A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE S&P, 2008.
50. V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft. Privacy-preserving ridge regression on hundreds of millions of records. In IEEE S&P, 2013.
51. K. Nissim and E. Weinreb. Communication efficient secure linear algebra. In TCC, 2006.
52. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT, 1999.
53. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure two-party computation is practical. In ASIACRYPT, 2009.
54. N. Pippenger and M. J. Fischer. Relations among complexity measures. J. ACM, 26(2), 1979.
55. M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981.
56. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6), 2009.
57. A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Efficient privacy-preserving face recognition. In ICISC, 2009.
58. E. Shi, T.-H. H. Chan, E. G. Rieffel, R. Chow, and D. Song. Privacy-preserving aggregation of time-series data. In NDSS, 2011.
59. Y. Tsiounis and M. Yung. On the security of ElGamal based encryption. In PKC, 1998.
60. G. Wang, T. Luo, M. T. Goodrich, W. Du, and Z. Zhu. Bureaucratic protocols for secure two-party sorting, selection, and permuting. In CCS, 2010.
61. U. Weinsberg, S. Bhagat, S. Ioannidis, and N. Taft. BlurMe: Inferring and obfuscating user gender based on ratings. In RecSys, 2012.
62. A. C.-C. Yao. Protocols for secure computations. In FOCS, 1982.
63. A. C.-C. Yao. How to generate and exchange secrets. In FOCS, 1986.