The Eigentrust algorithm for reputation management in P2P networks

  • Kamvar S
  • Schlosser M
  • Garcia-Molina H
N/ACitations
Citations of this article
258Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Peer-to-peer file-sharing networks are currently receiving much at- tention as a means of sharing and distributing information. How- ever, as recent experience shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files. We describe an algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that as- signs each peer a unique global trust value, based on the peer’s history of uploads. We present a distributed and secure method to compute global trust values, based on Power iteration. By having peers use these global trust values to choose the peers from whom they download, the network effectively identifies malicious peers and isolates them from the network. In simulations, this reputation system, called EigenTrust, has been shown to significantly decrease the number of inauthentic files on the network, even under a variety of conditions wheremalicious peers cooperate in an attempt to deliberately subvert the system.

Cite

CITATION STYLE

APA

Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The Eigentrust algorithm for reputation management in P2P networks (p. 640). Association for Computing Machinery (ACM). https://doi.org/10.1145/775240.775242

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free