Reference : Privacy-preserving Friendship-based Recommender Systems
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/29366
Privacy-preserving Friendship-based Recommender Systems
English
Tang, Qiang mailto []
Wang, Jun mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Nov-2016
IEEE Transactions on Dependable and Secure Computing
IEEE
Yes (verified by ORBilu)
International
1545-5971
IEEE Transactions on Dependable and Secure Computing
22-11-2016
[en] Recommender systems ; Encryption ; Privacy
[en] Privacy-preserving recommender systems have been an active research topic for many years. However, until today, it is still a challenge to design an efficient solution without involving a fully trusted third party or multiple semitrusted third parties. The key obstacle is the large underlying user populations (i.e. huge input size) in the systems. In this paper, we revisit the concept of friendship-based recommender systems, proposed by Jeckmans et al. and Tang and Wang. These solutions are very promising because recommendations are computed based on inputs from a very small subset of the overall user population (precisely, a user’s friends and some randomly chosen strangers). We first clarify the single prediction protocol and Top-n protocol by Tang and Wang, by correcting some flaws and improving the efficiency of the single prediction protocol. We then design a decentralized single protocol by getting rid of the semi-honest service provider. In order to validate the designed protocols, we crawl Twitter and construct two datasets (FMT and 10-FMT) which are equipped with auxiliary friendship information. Based on 10-FMT and MovieLens 100k dataset with simulated friendships, we show that even if our protocols use a very small subset of the datasets, their accuracy can still be equal to or better than some baseline algorithm. Based on these datasets, we further demonstrate that the outputs of our protocols leak very small amount of information of the inputs, and the leakage decreases when the input size increases. We finally show that he single prediction protocol is quite efficient but the Top-n is not. However, we observe that the efficiency of the Top-n protocol can be dramatically improved if we slightly relax the desired security guarantee.
http://hdl.handle.net/10993/29366

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
1152.pdfPublisher postprint1.76 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.