shilling attack
Recently Published Documents


TOTAL DOCUMENTS

58
(FIVE YEARS 21)

H-INDEX

8
(FIVE YEARS 2)

2022 ◽  
Vol 71 (2) ◽  
pp. 2827-2846
Author(s):  
Pradeep Kumar Singh ◽  
Pijush Kanti Dutta Pramanik ◽  
Madhumita Sardar ◽  
Anand Nayyar ◽  
Mehedi Masud ◽  
...  

2021 ◽  
Vol 63 ◽  
pp. 103051
Author(s):  
Hao Li ◽  
Min Gao ◽  
Fengtao Zhou ◽  
Yueyang Wang ◽  
Qilin Fan ◽  
...  

2021 ◽  
pp. 1-23
Author(s):  
Fabio Aiolli ◽  
Mauro Conti ◽  
Stjepan Picek ◽  
Mirko Polato

Nowadays, online services, like e-commerce or streaming services, provide a personalized user experience through recommender systems. Recommender systems are built upon a vast amount of data about users/items acquired by the services. Such knowledge represents an invaluable resource. However, commonly, part of this knowledge is public and can be easily accessed via the Internet. Unfortunately, that same knowledge can be leveraged by competitors or malicious users. The literature offers a large number of works concerning attacks on recommender systems, but most of them assume that the attacker can easily access the full rating matrix. In practice, this is never the case. The only way to access the rating matrix is by gathering the ratings (e.g., reviews) by crawling the service’s website. Crawling a website has a cost in terms of time and resources. What is more, the targeted website can employ defensive measures to detect automatic scraping. In this paper, we assess the impact of a series of attacks on recommender systems. Our analysis aims to set up the most realistic scenarios considering both the possibilities and the potential attacker’s limitations. In particular, we assess the impact of different crawling approaches when attacking a recommendation service. From the collected information, we mount various profile injection attacks. We measure the value of the collected knowledge through the identification of the most similar user/item. Our empirical results show that while crawling can indeed bring knowledge to the attacker (up to 65% of neighborhood reconstruction on a mid-size dataset and up to 90% on a small-size dataset), this will not be enough to mount a successful shilling attack in practice.


2021 ◽  
Vol 25 (3) ◽  
Author(s):  
Keya Chowdhury ◽  
Abhishek Majumder ◽  
Joy Lal Sarkar ◽  
Sukanta Chakraborty ◽  
Sudipta Roy

2021 ◽  
Author(s):  
Yanjing Yang ◽  
Min Gao ◽  
Yuerang Li ◽  
Fan Wu ◽  
Jia Wang ◽  
...  

Author(s):  
Fan Wu ◽  
Min Gao ◽  
Junliang Yu ◽  
Zongwei Wang ◽  
Kecheng Liu ◽  
...  

Author(s):  
Li Yang ◽  
Xinxin Niu

AbstractShilling attacks have been a significant vulnerability of collaborative filtering (CF) recommender systems, and trust in CF recommender algorithms has been proven to be helpful for improving the accuracy of system recommendations. As a few studies have been devoted to trust in this area, we explore the benefits of using trust to resist shilling attacks. Rather than simply using user-generated trust values, we propose the genre trust degree, which differ in terms of the genres of items and take both trust value and user credibility into consideration. This paper introduces different types of shilling attack methods in an attempt to study the impact of users’ trust values and behavior features on defending against shilling attacks. Meanwhile, it improves the approach used to calculate user similarities to form a recommendation model based on genre trust degrees. The performance of the genre trust-based recommender system is evaluated on the Ciao dataset. Experimental results demonstrated the superior and comparable genre trust degrees recommended for defending against different types of shilling attacks.


Sign in / Sign up

Export Citation Format

Share Document