More Web Proxy on the site http://driver.im/

Article

The Eigentrust algorithm for reputation management in P2P networks

Authors:

Sepandar D. Kamvar,

Mario T. Schlosser,

Hector Garcia-MolinaAuthors Info & Claims

WWW '03: Proceedings of the 12th international conference on World Wide Web

Pages 640 - 651

https://doi.org/10.1145/775152.775242

Published: 20 May 2003 Publication History

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

[1]

K. Aberer and Z. Despotovic. Managing Trust in a Peer-2-Peer Information System. In Proceedings of the 10th International Conference on Information and Knowledge Management (ACM CIKM), New York, USA, 2001.]]

Digital Library

[2]

Advogato's Trust Metric (White Paper), http://www.advogato.org/trust-metric.html.]]

[3]

T. Aura, P. Nikander, and J. Leiwo. Dos-resistant authentication with client puzzles. In 8th International Workshop on Security Protocols, 2000.]]

Digital Library

[4]

T. Beth, M. Borcherding, and B. Klein. Valuation of trust in open networks. In Proc. 3rd European Symposium on Research in Computer Security - ESORICS '94, pages 3--18, 1994.]]

Digital Library

[5]

Captcha Project. http://www.captcha.net.]]

[6]

F. Cornelli, E. Damiani, S. D. C. D. Vimercati, S. Paraboschi, and S. Samarati. Choosing Reputable Servents in a P2P Network. In Proceedings of the 11th World Wide Web Conference, Hawaii, USA, May 2002.]]

Digital Library

[7]

A. Crespo and H. Garcia-Molina. Semantic Overlay Networks. Submitted for publication 2002.]]

[8]

J. Douceur. The Sybil Attack. In First IPTPS, March 2002.]]

Digital Library

[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]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, August 2001.]]

Digital Library

[14]

P. Resnick, R. Zeckhauser, E. Friedman, and K. Kuwabara. Reputation Systems. Communications of the ACM, 43(12):45--48, 2000.]]

Digital Library

[15]

M. Ripeanu and I. Foster. Mapping the Gnutella Network - Macroscopic Properties of Large-scale P2P Networks and Implications for System Design. In Internet Computing Journal 6(1), 2002.]]

Digital Library

[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]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 149--160. ACM Press, 2001.]]

Digital Library

[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

Meena PKumar HYadav S(2025)Scene Inference Using Saliency Graphs With Trust-Theoretic Semantic Information EncodingIEEE Signal Processing Letters10.1109/LSP.2024.350853832(256-260)Online publication date: 2025
https://doi.org/10.1109/LSP.2024.3508538
Cotronei MGiuffrè SMarcianò ARosaci DSarnè G(2025)Using Trust and Reputation for Detecting Groups of Colluded Agents in Social NetworksIEEE Access10.1109/ACCESS.2024.352256013(1511-1521)Online publication date: 2025
https://doi.org/10.1109/ACCESS.2024.3522560
Zhang MWu CLi JGuo M(2025)Dynamic-EC: an efficient dynamic erasure coding method for permissioned blockchain systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-023-3209-319:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11704-023-3209-3
Show More Cited By

Index Terms

The Eigentrust algorithm for reputation management in P2P networks

Recommendations

New metrics for reputation management in P2P networks
AIRWeb '07: Proceedings of the 3rd international workshop on Adversarial information retrieval on the web

In this work we study the effectiveness of mechanisms for decentralized reputation management in P2P networks. We depart from Eigen Trust, an algorithm designed for reputation management in file sharing applications over p2p networks. EigenTrust has ...
Reputation management algorithms for DHT-based peer-to-peer environment

This paper addresses the problem of integration of reputation management mechanisms into data look-up and routing processes to cope with some specific security problems in peer-to-peer (P2P) networks based on Distributed Hash Tables (DHT). The goal is ...
Self-protection in p2p networks: choosing the right neighbourhood
IWSOS'06/EuroNGI'06: Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems

In unstructured peer-to-peer networks, as in real life, a good neighbourhood is not only crucial for a peaceful sleep, but also for an exchange of important gossips and for finding good service.

This work investigates self-protection mechanisms based on ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '03: Proceedings of the 12th international conference on World Wide Web

May 2003

772 pages

ISBN:1581136803

DOI:10.1145/775152

Conference Chairs:
Gusztáv Hencsey
MTA SZTAKI, Hungary
,
Bebo White
Stanford Linear Accelerator Center, USA
,
Program Chairs:
Yih-Farn Robin Chen
AT&T Labs -- Research, USA
,
László Kovács
MTA SZTAKI, Hungary
,
Steve Lawrence
Google Inc., USA

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

ACM: Association for Computing Machinery

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,459
Total Citations
View Citations
8,794
Total Downloads

Downloads (Last 12 months)210
Downloads (Last 6 weeks)18

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Meena PKumar HYadav S(2025)Scene Inference Using Saliency Graphs With Trust-Theoretic Semantic Information EncodingIEEE Signal Processing Letters10.1109/LSP.2024.350853832(256-260)Online publication date: 2025
https://doi.org/10.1109/LSP.2024.3508538
Cotronei MGiuffrè SMarcianò ARosaci DSarnè G(2025)Using Trust and Reputation for Detecting Groups of Colluded Agents in Social NetworksIEEE Access10.1109/ACCESS.2024.352256013(1511-1521)Online publication date: 2025
https://doi.org/10.1109/ACCESS.2024.3522560
Zhang MWu CLi JGuo M(2025)Dynamic-EC: an efficient dynamic erasure coding method for permissioned blockchain systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-023-3209-319:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11704-023-3209-3
Bandhana AKroupa TGarcía SDastani MSichman JAlechina NDignum V(2024)Trust in Shapley: A Cooperative Quest for Global Trust in P2P NetworkProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662860(132-140)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662860
ZHONG Y(2024)Real-Time Monitoring Systems That Provide M2M Communication between MachinesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2023EAP1049E107.A:7(1019-1026)Online publication date: 1-Jul-2024
https://doi.org/10.1587/transfun.2023EAP1049
Patterson DTomlinson B(2024)Xylem: An Energy-efficient, Globally Redistributive, Financial Infrastructure Using Proof-by-LocationDistributed Ledger Technologies: Research and Practice10.1145/36536803:3(1-27)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1145/3653680
Xu ZLi QShi WJiang YYuan ZZhang PMuntean GChua TNgo CKa-Wei Lee RKumar RLauw H(2024)NCTM: A Novel Coded Transmission Mechanism for Short Video DeliveriesProceedings of the ACM Web Conference 202410.1145/3589334.3645387(2847-2858)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645387
Truong BAllen OMenczer F(2024)Account credibility inference based on news-sharing networksEPJ Data Science10.1140/epjds/s13688-024-00450-913:1Online publication date: 31-Jan-2024
https://doi.org/10.1140/epjds/s13688-024-00450-9
Okegbile SCai JAlfa A(2024)Practical Byzantine Fault Tolerance-Enhanced Blockchain-Enabled Data Sharing System: Latency and Age of Data Package AnalysisIEEE Transactions on Mobile Computing10.1109/TMC.2022.322330623:1(737-753)Online publication date: Jan-2024
https://doi.org/10.1109/TMC.2022.3223306
Yan KMa WSun S(2024)Communications and Networks Resources Sharing in 6G: Challenges, Architecture, and OpportunitiesIEEE Wireless Communications10.1109/MWC.003.240003831:6(102-109)Online publication date: Dec-2024
https://doi.org/10.1109/MWC.003.2400038
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents