Abstract | ||
---|---|---|
With the development of the internet, recommendation systems play a significant role for providing personalised services in our life. However, this raises serious concerns about privacy since the system collects a lot of personal information. Thus, plenty of schemes have been proposed to address the privacy issues by using cryptographic techniques. However, with the rapidly increasing numbers of users and items, most of existing cryptography-based schemes become inefficient because of the huge computation cost. In this paper, we propose an efficient privacy-preserving scheme for recommendation systems. Compared with existing schemes, our scheme does not require that friends of user are online during computing predicted rating. Finally, we evaluate the performance of our scheme with the MovieLens 20 m dataset and it shows that our scheme can reduce the overhead of computation and communication. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1504/IJES.2019.10022131 | INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS |
Keywords | Field | DocType |
recommendation system, privacy-preserving, homomorphic encryption, proxy re-encryption | Recommender system,Homomorphic encryption,Computer science,Computer security,Cryptography,MovieLens,Real-time computing,Personally identifiable information,The Internet,Computation,Proxy re-encryption | Journal |
Volume | Issue | ISSN |
11 | 4 | 1741-1068 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bingpeng Ou | 1 | 0 | 0.34 |
Jingjing guo | 2 | 1 | 6.11 |
Xiaoling Tao | 3 | 30 | 8.14 |