Cryptology ePrint Archive: Report 2015/1152

Privacy-preserving Friendship-based Recommender Systems

Qiang Tang and Jun Wang

Abstract: 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 semi-trusted 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.

Category / Keywords: cryptographic protocols / recommender system, privacy, homomorphic encryption

Original Publication (with major differences): IEEE Transactions on Dependable and Secure Computing

Date: received 27 Nov 2015, last revised 18 Nov 2016

Contact author: tonyrhul at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20161118:191242 (All versions of this report)

Short URL: ia.cr/2015/1152

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]