Shilling attacks against memory-based privacy-preserving recommendation algorithms

24Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

Privacy-preserving collaborative filtering schemes are becoming increasingly popular because they handle the information overload problem without jeopardizing privacy. However, they may be susceptible to shilling or profile injection attacks, similar to traditional recommender systems without privacy measures. Although researchers have proposed various privacy-preserving recommendation frameworks, it has not been shown that such schemes are resistant to profile injection attacks. In this study, we investigate two memory-based privacy-preserving collaborative filtering algorithms and analyze their robustness against several shilling attack strategies. We first design and apply formerly proposed shilling attack techniques to privately collected databases. We analyze their effectiveness in manipulating predicted recommendations by experimenting on real data-based benchmark data sets. We show that it is still possible to manipulate the predictions significantly on databases consisting of masked preferences even though a few of the attack strategies are not effective in a privacy-preserving environment. © 2013 KSII.

Cite

CITATION STYLE

APA

Gunes, I., Bilge, A., & Polat, H. (2013). Shilling attacks against memory-based privacy-preserving recommendation algorithms. KSII Transactions on Internet and Information Systems, 7(5), 1272–1290. https://doi.org/10.3837/tiis.2013.05.019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free