The EigenTrust algorithm for reputation management in P2P networks
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.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Economic theory indicates a balance between the cost of building a good reputation and the financial benefit of having one, leading to an equilibrium.
“Economic theory indicates that there is a balance between the cost of establishing a good reputation and the financial benefit of having a good reputation, leading to an equilibrium [36,62].”
From A survey of trust and reputation systems for online service provision (2007) · cites this paper as [36]
Cites
(1999) · Cited by 12,854 · see citing works
Stoica, I. G., Morris, R., Karger, D. R., Kaashoek, M. F., & Balakrishnan, H. (2001) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/383059.383071 · Cited by 9,622 · see citing works
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M. J., Karp, R. M., & Shenker, S. J. (2001) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/383059.383072 · Cited by 6,433 · see citing works
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · see citing works
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190 · see citing works
Measurement study of peer-to-peer file sharing systems
Saroiu, S., Gummadi, K. P., & Gribble, S. D. (2001) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.449977 · Cited by 1,917 · see citing works
Managing trust in a peer-2-peer information system
(2001) · doi:10.1145/502585.502638 · Cited by 896 · see citing works
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 767 · see citing works
Valuation of trust in open networks
Beth, T., Borcherding, M., & Klein, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58618-0_53 · Cited by 654 · see citing works
DOS-Resistant Authentication with Client Puzzles
Aura, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44810-1_23 · Cited by 380 · see citing works
Choosing reputable servents in a P2P network
Cornelli, F., Damiani, E., di Vimercati, S. D. C., et al. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511496 · Cited by 349 · see citing works
The Second Eigenvalue of the Google Matrix
Haveliwala, T. H., & Kamvar, S. D. (2003) · Cited by 260 · see citing works
Self-citationIncentives for Combatting Freeriding on P2P Networks
Kamvar, S. D., Schlosser, M. T., & García-Molina, H. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45209-6_171 · Cited by 69 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Spreading activation models for trust propagation
Ziegler, C.-N., & Lausen, G. (2004) · IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004 · doi:10.1109/eee.2004.1287293 · Cited by 293 · see citing works
Integro: Leveraging Victim Prediction for Robust Fake Account Detection in OSNs
Boshmaf, Y., Logothetis, D., Siganos, G., Leria, J., Lorenzo, J., Ripeanu, M., & Beznosov, K. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23260 · Cited by 134 · see citing works
The Sustainability of Polycentric Information Commons1
Mindel, V., Mathiassen, L., & Rai, A. (2018) · MIS Quarterly · doi:10.25300/misq/2018/14015 · Cited by 90 · see citing works
Tang, J., & Liu, H. (2015) · Synthesis Lectures on Information Security, Privacy, and Trust · doi:10.2200/s00657ed1v01y201507spt013 · Cited by 53 · see citing works
Roy, A., Huh, J., Pfeuffer, A., & Srivastava, J. (2017) · Journal of Advertising · doi:10.1080/00913367.2017.1297272 · Cited by 41 · see citing works
Yuan, L., He, Q., Tan, S., Li, B., Yu, J., Chen, F., & Yang, Y. (2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2022.3231296 · Cited by 33 · see citing works
A hybrid trust model using reinforcement learning and fuzzy logic
Aref, A., & Tran, T. (2018) · Computational Intelligence · doi:10.1111/coin.12155 · Cited by 16 · see citing works
- Authors
- Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H.
- Affiliations
- Stanford University (US)
- ORCID
- Schlosser, Mario T.
- Venue
- Proceedings of the twelfth international conference on World Wide Web - WWW '03
- Publisher
- ACM Press
- Published
- 2003
- Pages
- 640
- OpenAlex
- W2156523427
- Cited by
- 3,362
- References
- 13
- Citations by year
- 2026: 38 · 2025: 36 · 2024: 36 · 2023: 45 · 2022: 57 · 2021: 65 · 2020: 71 · 2019: 74 · 2018: 103 · 2017: 101 · 2016: 134 · 2015: 166 · 2014: 177 · 2013: 183 · 2012: 258
- Type
- conference abstract
- Language
- en
- Open access
- closed
- Locations
- International World Wide Web Conference (WWW) (publishedVersion)
- Topics
- Social Sciences › Sociology and Political Science › Access Control and Trust
- Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Keywords
- EigenTrust, peer-to-peer file sharing, reputation management, trust evaluation, malicious peer detection, power iteration, anonymity networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
