• DocumentCode
    1692067
  • Title

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

  • Author

    Zhai, Ennan ; Chen, Ruichuan ; Lua, Eng Keong ; Zhang, Long ; Sun, Huiping ; Cai, Zhuhua ; Qing, Sihan ; Chen, Zhong

  • Author_Institution
    Sch. of Software & Microelectron., Peking Univ., Beijing, China
  • fYear
    2009
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    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, SpamResist 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.
  • Keywords
    peer-to-peer computing; security of data; unsolicited e-mail; SpamResist mechanism; peer-to-peer tagging systems; social reliability-based mechanism; spam; Convergence; Educational technology; Laboratories; Microelectronics; Peer to peer computing; Robustness; Sun; Tagging; Unsolicited electronic mail; Videos;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
  • Conference_Location
    Honolulu, HI
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-4148-8
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2009.5425801
  • Filename
    5425801