Privacy Preserving Collaborative Filtering via the Johnson-Lindenstrauss Transform

Recommendation systems have become increasingly popular as a result of the significant growth in online information. However, it requires a substantial amount of historical user data to generate accurate predictions, which raises concerns over user privacy. Differential privacy is a well acknowledged privacy notion that has become an important standard for the preservation of privacy. Unfortunately, existing privacy preservation methods based on differential privacy protect user privacy at the cost of utility, aspects of which have to be sacrificed to ensure that privacy is maintained. In this paper, we propose a Johnson Lindenstrauss privacy preserving collaborative filtering (JLCF) method. The proposed method preserves users' privacy without compromising utility. It guarantees user privacy by directly perturbing the original dataset using a transfer matrix. We prove that the proposed method achieves -differential privacy. In addition, we theoretically analyse the utility of the proposed method, and our extensive experiments show that the prediction accuracy is improved.

[1]  Cynthia Dwork,et al.  Differential Privacy: A Survey of Results , 2008, TAMC.

[2]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[3]  Xintao Wu,et al.  Using Randomized Response for Differential Privacy Preserving Data Collection , 2016, EDBT/ICDT Workshops.

[4]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[5]  Aaron Roth,et al.  A learning theory approach to non-interactive database privacy , 2008, STOC.

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  Anne-Marie Kermarrec,et al.  Heterogeneous Differential Privacy , 2015, J. Priv. Confidentiality.

[8]  Jing Zhao,et al.  Achieving differential privacy of data disclosure in the smart grid , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[9]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[10]  Tianqing Zhu,et al.  An effective privacy preserving algorithm for neighborhood-based collaborative filtering , 2014, Future Gener. Comput. Syst..

[11]  Hongxia Jin,et al.  EpicRec: Towards Practical Differentially Private Framework for Personalized Recommendation , 2016, CCS.

[12]  Avrim Blum,et al.  The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[13]  Dimitris Achlioptas,et al.  Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..

[14]  Ilya Mironov,et al.  Differentially private recommender systems: building privacy into the net , 2009, KDD.

[15]  Naren Ramakrishnan,et al.  Privacy Risks in Recommender Systems , 2001, IEEE Internet Comput..

[16]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[17]  Mohamed Ali Kâafar,et al.  A differential privacy framework for matrix factorization recommender systems , 2016, User Modeling and User-Adapted Interaction.

[18]  Vitaly Shmatikov,et al.  2011 IEEE Symposium on Security and Privacy “You Might Also Like:” Privacy Risks of Collaborative Filtering , 2022 .

[19]  Roksana Boreli,et al.  Applying Differential Privacy to Matrix Factorization , 2015, RecSys.

[20]  Anne-Marie Kermarrec,et al.  D2P: Distance-Based Differential Privacy in Recommenders , 2015, Proc. VLDB Endow..