SpamResist: Making Peer-to-Peer Tagging Systems Robust to Spam

Tagging systems are known to be particularly vulnerable to tag spam. Due to the self-organization and self-maintenance nature of Peer-to-Peer (P2P) overlay networks, users in the P2P tagging systems are more vulnerable to tag spam than the centralized ones. This paper proposes SpamResist, a novel social reliability-based mechanism. For each tag search, Spam-Resist client groups the search respondents into two categories, namely unfamiliar peers and interacted peers according to the fact whether the client has interacted with such respondents. For the two different categories of peers, the client computes their reliability degrees, and then utilizes these reliability degrees as weights to rank search results. To obtain higher quality search results, we propose a socially-enhanced mechanism, considering social friends can share their previous experience and help improve both the performance and convergence of SpamResist. Finally, the experimental results illustrate that SpamResist can effectively defend against tag spam and work better than the existing search models in P2P tagging systems.

[1]  T. Kalamboukis,et al.  Combining Clustering with Classification for Spam Detection in Social Bookmarking Systems ? , 2008 .

[2]  Jianchang Mao,et al.  Towards the Semantic Web: Collaborative Tag Suggestions , 2006 .

[3]  A.P.J. van den Bosch,et al.  Using language models for spam detection in social bookmarking , 2008 .

[4]  Georgia Koutrika,et al.  Fighting Spam on Social Web Sites: A Survey of Approaches and Future Challenges , 2007, IEEE Internet Computing.

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  Georgia Koutrika,et al.  Combating spam in tagging systems , 2007, AIRWeb '07.

[7]  Keith W. Ross,et al.  Efficient Blacklisting and Pollution-Level Estimation in P2P File-Sharing Systems , 2005, AINTEC.

[8]  Steffen Staab,et al.  PINTS: peer-to-peer infrastructure for tagging systems , 2008, IPTPS.

[9]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[10]  Rakesh Kumar,et al.  Pollution in P2P file sharing systems , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Rui Li,et al.  Towards effective browsing of large scale social annotations , 2007, WWW '07.

[12]  Andreas Hotho,et al.  The anti-social tagger: detecting spam in social bookmarking systems , 2008, AIRWeb '08.

[13]  Steffen Staab,et al.  Tagster - Tagging-Based Distributed Content Sharing , 2008, ESWC.

[14]  Anthony McMullen.  CiteULike: http://www.citeulike.org , 2010 .

[15]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[16]  John Langford,et al.  CAPTCHA: Using Hard AI Problems for Security , 2003, EUROCRYPT.

[17]  Jun Wang,et al.  TRIBLER: a social‐based peer‐to‐peer system , 2008, IPTPS.

[18]  Anestis Gkanogiannis,et al.  A novel supervised learning algorithm and its use for Spam Detection in Social Bookmarking Systems , 2008 .

[19]  T. Lau,et al.  Fringe Contacts: People-Tagging for the Enterprise , 2006 .

[20]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.