Authors: Bingpeng Ou; Jingjing Guo; Xiaoling Tao
Addresses: State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, Shaanxi, China ' State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, Shaanxi, China ' School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi, China
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.
Keywords: recommendation system; privacy-preserving; homomorphic encryption; proxy re-encryption.
International Journal of Embedded Systems, 2019 Vol.11 No.4, pp.516 - 525
Received: 26 Apr 2017
Accepted: 31 Jul 2017
Published online: 25 Jun 2019 *