Efficient Privacy-Preserving Matrix Factorization for Recommendation via Fully Homomorphic Encryption

被引:42
作者
Kim, Jinsu [1 ]
Koo, Dongyoung [2 ]
Kim, Y. U. Na [1 ]
Yoon, Hyunsoo [3 ]
Shin, Junbum [1 ]
Kim, Sungwook [1 ]
机构
[1] Samsung Elect, Samsung Res, Suwon, South Korea
[2] Hansung Univ, Dept Elect & Informat Engn, Seoul, South Korea
[3] Korea Adv Inst Sci & Technol, Sch Comp, Daejeon, South Korea
基金
新加坡国家研究基金会;
关键词
Homomorphic encryption; matrix factorization; gradient descent; privacy-preserving recommendation; SECURITY;
D O I
10.1145/3212509
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
There are recommendation systems everywhere in our daily life. The collection of personal data of users by a recommender in the system may cause serious privacy issues. In this article, we propose the first privacy-preserving matrix factorization for recommendation using fully homomorphic encryption. Our protocol performs matrix factorization over encrypted users' rating data and returns encrypted outputs so that the recommendation system learns nothing on rating values and resulting user/item profiles. Furthermore, the protocol provides a privacy-preserving method to optimize the tuning parameters that can be a business benefit for the recommendation service providers. To overcome the 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 for matrix factorization, through secure two-party computation in part. Our experiments demonstrate the efficiency of our protocol.
引用
收藏
页数:30
相关论文
共 58 条