Alliatrust: A Trustable Reputation Management Scheme for Unstructured P2P Systems
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.
KeywordsDistribute Hash Table Threat Model Polluted Content Malicious Peer Manager List
Unable to display preview. Download preview PDF.
- 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.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.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
- 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.Limewire, http://www.limewire.org/
- 8.KaZaA, http://www.kazaa.com/
- 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.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
- 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.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.Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an internetwork. In: Proceedings of IEEE Infocom, pp. 594–602 (1996)Google Scholar
- 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