An efficient privacy-preserving friendship-based recommendation system
by Bingpeng Ou; Jingjing Guo; Xiaoling Tao
International Journal of Embedded Systems (IJES), Vol. 11, No. 4, 2019

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.

Online publication date: Fri, 19-Jul-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com