Efficient, secure and verifiable outsourcing scheme for SVD-based collaborative filtering recommender system

被引:7
作者
Tao, Yunting [1 ,3 ]
Kong, Fanyu [1 ]
Shi, Yuliang [1 ]
Yu, Jia [2 ]
Zhang, Hanlin [2 ]
Wang, Xiangyi [1 ]
机构
[1] Shandong Univ, Sch Software, Jinan 250101, Shandong, Peoples R China
[2] Qingdao Univ, Coll Comp Sci & Technol, Qingdao 266071, Shandong, Peoples R China
[3] Binzhou Polytech, Coll Informat Engn, Binzhou 256603, Shandong, Peoples R China
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2023年 / 149卷
关键词
Recommender system; Collaborative filtering; Secure outsourcing computation; Singular Value Decomposition (SVD); Privacy preserving; Cloud computing; LARGE MATRIX; COMPUTATION; FRAMEWORK; SERVICE;
D O I
10.1016/j.future.2023.07.042
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the explosive growth of e-commerce, recommender systems are widely used to generate personalized recommendation for customers. SVD-based collaborative filtering and its variants are highly accurate and scalable approaches to recommender systems. Due to the heavy computation of SVD-based collaborative filtering, outsourcing the computation is an efficient solution to reduce computational complexity. In this paper, we propose an efficient, secure and verifiable outsourcing scheme for SVD-based collaborative filtering recommender system. We use symmetric block diagonal matrices as seeds to generate secret keys, which are novel orthogonal sparse matrices to blind the target matrices of SVD. Security analysis shows that our scheme can protect the privacy of both the input and output and efficiency analysis shows that our scheme is (3m2+3n2+5mn)/(m3+n3) efficient compared to fully local algorithm. In our scheme, we also create a verification approach that is capable of detecting misbehavior from a cloud server with probability (1-2n1 ). The experiment shows that the client achieves significant computational savings and the recommendation accuracy of the scheme is nearly as good as that of the fully local algorithm.
引用
收藏
页码:445 / 454
页数:10
相关论文
共 42 条
[1]  
Abdi M.H., 2018, Matrix factorization techniques for contextaware collaborative filtering recommender systems: a survey
[2]  
Ahuja R, 2019, 2019 9TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, DATA SCIENCE & ENGINEERING (CONFLUENCE 2019), P263, DOI [10.1109/confluence.2019.8776969, 10.1109/CONFLUENCE.2019.8776969]
[3]  
AL SABAAWI A., 2021, Two Models Based on Social Relations and SVD++ Method for Recommendation System
[4]  
Ardiansyah Muhammad Iqbal, 2019, 2019 International Conference of Artificial Intelligence and Information Technology (ICAIIT). Proceedings, P422, DOI 10.1109/ICAIIT.2019.8834597
[5]  
Atallah MJ, 2001, ADV COMPUT, V54, P215
[6]   Privacy Preserving User Based Web Service Recommendations [J].
Badsha, Shahriar ;
Yi, Xun ;
Khalil, Ibrahim ;
Liu, Dongxi ;
Nepal, Surya ;
Lam, Kwok-Yan .
IEEE ACCESS, 2018, 6 :56647-56657
[7]  
Bin Li, 2020, 2020 IEEE International Conference on Advances in Electrical Engineering and Computer Applications (AEECA), P796, DOI 10.1109/AEECA49918.2020.9213566
[8]   Matrix Factorization Model in Collaborative Filtering Algorithms: A Survey [J].
Bokde, Dheeraj ;
Girase, Sheetal ;
Mukhopadhyay, Debajyoti .
PROCEEDINGS OF 4TH INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATION AND CONTROL(ICAC3'15), 2015, 49 :136-146
[9]  
Boulle N, 2022, Arxiv, DOI arXiv:2105.13052
[10]   SecRec: A Privacy-Preserving Method for the Context-Aware Recommendation System [J].
Chen, Jinrong ;
Liu, Lin ;
Chen, Rongmao ;
Peng, Wei ;
Huang, Xinyi .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (05) :3168-3182