ACM Home Page
Please provide us with feedback. Feedback
The Eigentrust algorithm for reputation management in P2P networks
Full text PdfPdf (203 KB)
Source International World Wide Web Conference archive
Proceedings of the 12th international conference on World Wide Web table of contents
Budapest, Hungary
SESSION: Protocols table of contents
Pages: 640 - 651  
Year of Publication: 2003
ISBN:1-58113-680-3
Authors
Sepandar D. Kamvar  Stanford University, Stanford, CA
Mario T. Schlosser  Stanford University, Stanford, CA
Hector Garcia-Molina  Stanford University, Stanford, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 75,   Downloads (12 Months): 471,   Citation Count: 200
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775152.775242
What is a DOI?

ABSTRACT

Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, 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 assigns 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 where malicious peers cooperate in an attempt to deliberately subvert the system.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Advogato's Trust Metric (White Paper), http://www.advogato.org/trust-metric.html.
 
3
 
4
 
5
Captcha Project. http://www.captcha.net.
6
 
7
A. Crespo and H. Garcia-Molina. Semantic Overlay Networks. Submitted for publication 2002.
 
8
 
9
eBay website. www.ebay.com.
 
10
T. H. Haveliwala and S. D. Kamvar. The second eigenvalue of the google matrix. Technical report, Stanford University, 2003.
 
11
S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. Incentives for Combatting Freeriding on P2P Networks. Technical report, Stanford University, 2003.
 
12
L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998.
13
14
 
15
 
16
S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA, USA, January 2002.
 
17
M. T. Schlosser and S. D. Kamvar. Simulating P2P Networks. Technical report, Stanford University, 2003.
18
 
19
VBS.Gnutella Worm. http://securityresponse.symantec.com/avcenter/venc/data/vbs.gnutella.html.
 
20
B. Yang, S. D. Kamvar, and H. Garcia-Molina. Secure Score Management for P2P Systems. Technical report, Stanford University, 2003.

CITED BY  204

Collaborative Colleagues:
Sepandar D. Kamvar: colleagues
Mario T. Schlosser: colleagues
Hector Garcia-Molina: colleagues