Advertisement

Alliatrust: A Trustable Reputation Management Scheme for Unstructured P2P Systems

  • Jeffrey Gerard
  • Hailong Cai
  • Jun Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3947)

Abstract

Content pollution and free-riders are increasingly threatening the utility and dependability of modern peer-to-peer systems. One common defense against these threats is to maintain a reputation for each peer in the network based on its prior behavior and contributions, which can help other users make informed decisions about future transactions. However, most current reputation schemes for unstructured P2P systems are prone to attack and therefore not very reliable. In response, we propose a trustable, distributed, reputation-management scheme called Alliatrust to combat content pollution and free-riders. Alliatrust demonstrates resilience against collusion by malicious peers by elegantly managing distributed copies of reputation data on a few homologous peers. Simulations show that Alliatrust is able to reduce undesirable transfers of polluted resources to good peers by up to 70%, while decreasing the success of queries issued by malicious peers and free-riders.

Keywords

Distribute Hash Table Threat Model Polluted Content Malicious Peer Manager List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Le Fessant, F., Handurukande, S.B., Kermarrec, A.-M., Massoulié, L.: Clustering in peer-to-peer file sharing workloads. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 217–226. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Liang, J., Kumar, R., Xi, Y., Ross, K.W.: Pollution in P2P file sharing systems. In: Proceedings of IEEE Infocom (2005)Google Scholar
  3. 3.
    Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The Eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the 12th international conference on World Wide Web, pp. 640–651. ACM Press, New York (2003)Google Scholar
  4. 4.
    Xiong, L., Liu, L.: Peertrust: Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Transactions on Knowledge and Data Engineering, 843–857 (2004)Google Scholar
  5. 5.
    Cai, H., Wang, J., Li, D., Deogun, J.S.: A novel state cache scheme in structured P2P systems. Journal of Parallel and Distributed Computing 65, 154–168 (2005)CrossRefGoogle Scholar
  6. 6.
    Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like P2P systems scalable. In: SIGCOMM 2003: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 407–418. ACM Press, New York (2003)CrossRefGoogle Scholar
  7. 7.
  8. 8.
  9. 9.
    Dutta, D., Goel, A., Govindan, R., Zhang, H.: The design of a distributed rating scheme for peer-to-peer systems. In: Workshop on Economics of Peer-to-Peer Systems (2003)Google Scholar
  10. 10.
    Gupta, M., Judge, P., Ammar, M.: A reputation system for peer-to-peer networks. In: Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video, pp. 144–152. ACM Press, New York (2003)Google Scholar
  11. 11.
    Marti, S., Garcia-Molina, H.: Limited reputation sharing in P2P systems. In: Proceedings of the 5th ACM conference on Electronic commerce, pp. 91–101. ACM Press, New York (2004)CrossRefGoogle Scholar
  12. 12.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. Technical Report UW-CSE-01-06-02 (University of Washington)Google Scholar
  13. 13.
    Ranganathan, K., Ripeanu, M., Sarin, A., Foster, I.: To share or not to share: An analysis of incentives to contribute in collaborative file sharing environments. In: Workshop on Economics of Peer-to-Peer Systems (2003)Google Scholar
  14. 14.
    Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an internetwork. In: Proceedings of IEEE Infocom, pp. 594–602 (1996)Google Scholar
  15. 15.
    Cai, H., Wang, J.: Foreseer: A novel, locality-aware peer-to-peer system architecture for keyword searches. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 38–58. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Schlosser, M.T., Condie, T.E., Kamvar, S.D.: Simulating a P2P file-sharing network. In: First Workshop on Semantics in P2P and Grid Computing (2002)Google Scholar
  17. 17.
    Douceur, J.R.: The Sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jeffrey Gerard
    • 1
  • Hailong Cai
    • 1
  • Jun Wang
    • 1
  1. 1.Computer Science & EngineeringUniversity of Nebraska–LincolnUSA

Personalised recommendations