Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption
Authors:
Open Access
- 30 May 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 617-628
Abstract
Recommendation systems become popular in our daily life. It is well known that the more the release of users' personal data, the better the quality of recommendation. However, such services raise serious privacy concerns for users. In this paper, focusing on matrix factorization-based recommendation systems, we propose the first privacy-preserving matrix factorization using fully homomorphic encryption. On inputs of encrypted users' ratings, our protocol performs matrix factorization over the encrypted data and returns encrypted outputs so that the recommendation system knows nothing on rating values and resulting user/item profiles. It provides a way to obfuscate the number and list of items a user rated without harming the accuracy of recommendation, and additionally protects recommender's tuning parameters for business benefit and allows the recommender to optimize the parameters for quality of service. To overcome performance degradation caused by the use of fully homomorphic encryption, we introduce a novel data structure to perform computations over encrypted vectors, which are essential operations for matrix factorization, through secure 2-party computation in part. With the data structure, the proposed protocol requires dozens of times less computation cost over those of previous works. Our experiments on a personal computer with 3.4 GHz 6-cores 64 GB RAM show that the proposed protocol runs in 1.5 minutes per iteration. It is more efficient than Nikolaenko et al.'s work proposed in CCS 2013, in which it took about 170 minutes on two servers with 1.9 GHz 16-cores 128 GB RAM.Keywords
This publication has 38 references indexed in Scilit:
- Fully homomorphic SIMD operationsDesigns, Codes and Cryptography, 2012
- Better Bootstrapping in Fully Homomorphic Encryption2012
- Homomorphic Evaluation of the AES Circuit2012
- A Survey of Collaborative Filtering TechniquesAdvances in Artificial Intelligence, 2009
- Calibrating Noise to Sensitivity in Private Data Analysis2006
- Encoding-Free ElGamal Encryption Without Random Oracles2006
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Privacy risks in recommender systemsIEEE Internet Computing, 2001
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996