Federated matrix factorization for privacy-preserving recommender systems

被引:45
作者
Du, Yongjie [1 ]
Zhou, Deyun [1 ]
Xie, Yu [3 ]
Shi, Jiao [1 ]
Gong, Maoguo [2 ]
机构
[1] Northwestern Polytech Univ, Sch Elect & Informat, Xian 710071, Shaanxi, Peoples R China
[2] Xidian Univ, Int Res Ctr Intelligent Percept & Computat, Key Lab Intelligent Percept & Image Understanding, Xian 710071, Shaanxi, Peoples R China
[3] Shanxi Univ, Key Lab Computat Intelligence & Chinese Informat, Taiyuan 030006, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Matrix factorization; Federated learning; Randomized response; Recommender system; Differential privacy;
D O I
10.1016/j.asoc.2021.107700
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recommender systems recommend contents or services via collecting and analyzing numerous user data, which may raise serious privacy concerns when the recommender is untrusted. Inspired by federated learning, a user-level distributed matrix factorization framework has been proposed where the model can be learned via collecting gradient information from users (instead of the raw data). This approach focuses on protecting model-privacy and value-privacy from untrusted recommender but has limited consideration on existence-privacy. To address this issue, we enhance the aforementioned framework with Homomorphic Encryption and randomized response. Extensive experiments demonstrate that our method can provide more secure protection for users' privacy with less performance degradation and smaller computational burden. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 29 条
[1]   A Survey on Homomorphic Encryption Schemes: Theory and Implementation [J].
Acar, Abbas ;
Aksu, Hidayet ;
Uluagac, A. Selcuk ;
Conti, Mauro .
ACM COMPUTING SURVEYS, 2018, 51 (04)
[2]  
Balu R., 2016, P 4 ACM WORKSH INF H, P57, DOI [DOI 10.1145/2909827.2930793, 10.1145/2909827.2930793]
[3]   Secure Federated Matrix Factorization [J].
Chai, Di ;
Wang, Leye ;
Chen, Kai ;
Yang, Qiang .
IEEE INTELLIGENT SYSTEMS, 2021, 36 (05) :11-19
[4]   Calibrating noise to sensitivity in private data analysis [J].
Dwork, Cynthia ;
McSherry, Frank ;
Nissim, Kobbi ;
Smith, Adam .
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 :265-284
[5]   RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response [J].
Erlingsson, Ulfar ;
Pihur, Vasyl ;
Korolova, Aleksandra .
CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2014, :1054-1067
[6]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178
[7]   A Survey on Differentially Private Machine Learning [Review Article] [J].
Gong, Maoguo ;
Xie, Yu ;
Pan, Ke ;
Feng, Kaiyuan ;
Qin, A. K. .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2020, 15 (02) :49-88
[8]   Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition [J].
Gong, Maoguo ;
Pan, Ke ;
Xie, Yu ;
Qin, A. K. ;
Tang, Zedong .
NEURAL NETWORKS, 2020, 125 :131-141
[9]  
Guo G., 2013, P 23 INT JOINT C ART, P2619
[10]   Locally differentially private item-based collaborative filtering [J].
Guo, Taolin ;
Luo, Junzhou ;
Dong, Kai ;
Yang, Ming .
INFORMATION SCIENCES, 2019, 502 :229-246