Taxonomy of trust: Categorizing P2P reputation systems
Computer NetworksPublished 1 September 2005
Sergio Marti, Héctor García-Molina
Citations432
SJR quartileQ1
SJR score1.17
SNIP1.37
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work presents a taxonomy of reputation system components, their properties, and describes research that exemplifies compromises made to deliver a useable, implementable system.
Abstract
The field of peer-to-peer reputation systems has exploded in the last few years. Our goal is to organize existing ideas and work to facilitate system design. We present a taxonomy of reputation system components, their properties, and discuss how user behavior and technical constraints can conflict. In our discussion, we describe research that exemplifies compromises made to deliver a useable, implementable system.
Keywords
Computer ScienceSocial Sciences
The PageRank Citation Ranking : Bringing Order to the Web
12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Lecture notes in computer sciencePastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
7,296 Citations2001Antony Rowstron, Peter Druschel
Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
A scalable content-addressable network
6,407 Citations2001Sylvia Ratnasamy, Paul Francis +3 more
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Lecture notes in computer scienceThe Sybil Attack
4,328 Citations2002John R. Douceur
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
The Eigentrust algorithm for reputation management in P2P networks
3,353 Citations2003Sepandar Kamvar, Mario Schlösser +1 more
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 is described.
IEEE/ACM Transactions on NetworkingChord: a scalable peer-to-peer lookup protocol for internet applications
3,122 Citations2003Ion Stoica, Robert Morris +5 more
Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
Incentives Build Robustness in Bit-Torrent
2,661 Citations2003Bram Cohen
The BitTorrent file distribution system uses tit-fortat as a method of seeking pareto efficiency, which achieves a higher level of robustness and resource utilization than any currently known cooperative technique.
ACM SIGPLAN NoticesOceanStore
2,027 Citations2000John Kubiatowicz, David Bindel +10 more
OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data.
ACM Transactions on Information and System SecurityCrowds
1,785 Citations1998Michael K. Reiter, Aviel D. Rubin
The design, implementation, security, performance, and scalability of the Crowds system for protecting users' anonymity on the world-wide-web are described and degrees of anonymity as an important tool for describing and proving anonymity properties are introduced.
First MondayFree riding on Gnutella
1,529 Citations2000Eytan Adar, Bernardo A. Huberman
It is argued that free riding leads to degradation of the system performance and adds vulnerability to the system, and copyright issues might become moot compared to the possible collapse of such systems.
Propagation of trust and distrust
1,471 Citations2004R. Guha, Ravi Kumar +2 more
It is shown that a small number of expressed trusts/distrust per individual allows us to predict trust between any two people in the system with high accuracy.
OceanStore
868 Citations2000John Kubiatowicz, David Bindel +10 more
ACM SIGOPS Operating Systems ReviewSecure routing for structured peer-to-peer overlay networks
752 Citations2002Miguel Castro, Peter Druschel +3 more
This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.
Tarzan
671 Citations2002Michael J. Freedman, Robert Morris
Measurements show that Tarzan imposes minimal overhead over a corresponding non-anonymous overlay route, and Protocols toward unbiased peer-selection offer new directions for distributing trust among untrusted entities.
Anonymous connections and onion routing
632 Citations2002Paul Syverson, David M. Goldschlag +1 more
A detailed specification of the implemented onion routing system, a vulnerability analysis based on this specification, and performance results are provided.
The impact of DHT routing geometry on resilience and proximity
572 Citations2003Krishna P. Gummadi, R. Gummadi +4 more
The basic finding is that, despite the initial preference for more complex geometries, the ring geometry allows the greatest flexibility, and hence achieves the best resilience and proximity performance.
Robust incentive techniques for peer-to-peer networks
567 Citations2004Michal Feldman, Kevin Lai +2 more
This work model the P2P system using the Generalized Prisoner's Dilemma, and proposes the Reciprocative decision function as the basis of a family of incentives techniques that can drive a system of strategic users to nearly optimal levels of cooperation.
Journal of Economics & Management StrategyThe Social Cost of Cheap Pseudonyms
547 Citations2001Eric J. Friedman, Paul Resnick
Lecture notes in computer scienceA Social Mechanism of Reputation Management in Electronic Communities
464 Citations2000Bin Yu, Munindar P. Singh
This work proposes a social mechanism of reputation management, which aims at avoiding interaction with undesirable participants, and leads to a decentralized society in which agents help each other weed out undesirable players.
Journal of Economics & Management StrategyThe Social Cost of Cheap Pseudonyms
382 Citations2001Eric J. Friedman, Paul Resnick
Choosing reputable servents in a P2P network
349 Citations2002Fabrizio Cornelli, Ernesto Damiani +3 more
An approach to P2P security where servents can keep track, and share with others, information about the reputation of their peers is proposed, based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download.
Secure routing for structured peer-to-peer overlay networks
328 Citations2002Miguel Castro, Peter Druschel +3 more
TrustMe: anonymous management of trust relationships in decentralized P2P systems
291 Citations2003Aameek Singh, Ling Liu
The TrustMe protocol is shown to be extremely secure in the face of a variety of possible attacks and a thorough analysis of the protocol is presented, motivating the importance of anonymity, especially in such trust based systems.
Cooperative peer groups in NICE
259 Citations2003Sang Mi Lee, Rob Sherwood +1 more
A technique for efficiently storing user reputation information in a completely decentralized manner is described, and it is shown how this information can be used to efficiently identify noncooperative users in NICE.
Two Can Keep a Secret: A Distributed Architecture for Secure Database Services
252 Citations2005Gagan Aggarwal, Mayank Bawa +7 more
This work proposes a new, distributed architecture that allows an organization to outsource its data management to untrusted servers while preserving data privacy, and shows how the presence of two servers enables efficient partitioning of data.
Comparing Hybrid Peer-to-Peer Systems
236 Citations2001Beverly Yang, Héctor García-Molina
This paper model a file-sharing application, developing a probabilistic model to describe query behavior and expected query result sizes and an analytic model to describes system performance, and discusses the tradeoffs between the architectures.
PPay
215 Citations2003Beverly Yang, Héctor García-Molina
PPay is presented, a micropayment system that exploits unique characteristics of P2P systems to maximize efficiency while maintaining security properties, and it is shown how the basic PPay protocol far outperforms existing micropayan schemes, while guaranteeing that all coin fraud is detectable, traceable and unprofitable.
Computer NetworksCooperative peer groups in NICE
215 Citations2005Rob Sherwood, Seungjoon Lee +1 more
Limited reputation sharing in P2P systems
214 Citations2004Sergio Marti, Héctor García-Molina
It is shown that limited reputation sharing can reduce the number of failed transactions by a factor of 20 and the efficiency and load distribution of a peer-to-peer system is evaluated.
Free-riding and whitewashing in peer-to-peer systems
193 Citations2004Michal Feldman, Christos H. Papadimitriou +2 more
A model to study the phenomenon of free-riding and free-identities in peer-to-peer systems finds that imposing penalty on all users that join the system is effective under many scenarios and that system performance degrades significantly only when the turnover rate among users is high.
Lecture notes in computer scienceTrusting Information Sources One Citizen at a Time
150 Citations2002Yolanda Gil, Varun Ratnakar
TRELLIS is a system that helps users annotate their analysis of alternative information sources that can be contradictory and incomplete, and exploits the formal representations to derive measures of trust in the content of Web resources and their original source.
Lecture notes in computer scienceSPROUT: P2P Routing with Social Networks
121 Citations2004Sergio Marti, Prasanna Ganesan +1 more
A trust model that lets us compare routing algorithms for P2P networks overlaying social networks, and proposes SPROUT, a DHT routing algorithm that, by using social links, significantly increases the number of query results and reduces query delays.
Designing incentives for peer-to-peer routing
105 Citations2005Alberto Blanc, Yi-Kai Liu +1 more
This paper model the interactions between nodes as a "random matching game", and describes a simple reputation system that provides incentives for good behavior under certain assumptions, and obtains a stable subgame-perfect equilibrium.
ACM SIGOPS Operating Systems ReviewPreserving peer replicas by rate-limited sampled voting
101 Citations2003Petros Maniatis, David S. H. Rosenthal +4 more
Enhancing reputation mechanisms via online social networks
96 Citations2004Tad Hogg, Lada A. Adamic
Two uses of social networks are considered: as an automated aid to identify reputation based on position in the network, and as a filtering tool for users’ ratings, which can be efficiently computed using the network structure.
Identity crisis: anonymity vs reputation in P2P systems
88 Citations2004Sergio Marti, Héctor García-Molina
This work investigates the cost in efficiency of two solutions to the identity problem for peer-to-peer reputation systems and shows that, using some simple mechanisms, reputation systems can provide a factor of 4 to 20 improvement over no reputation system, depending on the identity model used.
Query-flood DoS attacks in gnutella
84 Citations2002Neil Daswani, Héctor García-Molina
A simple but effective traffic model is described that can be used to understand the effects of denial-of-service (DoS) attacks based on query floods in Gnutella networks and how application-level policies can localize the damage.
Escrow services and incentives in peer-to-peer networks
58 Citations2001Bill G. Horne, Benny Pinkas +1 more
This work integrates a P2P file sharing service with an escrow service that reliably "pays" the party that is serving up the content and motivates users to serve up content of high quality and verifies that users only share legitimate content and not spam, viruses or content that is not part of the subscription.
ePrints Soton (University of Southampton)Trust strategies for the semantic web
57 Citations2004Kieron O’Hara, Harith Alani +2 more
Five most common strategies of trust are identified and their envisaged costs and benefits are discussed to help system developers appreciate the risks and gains involved with each trust strategy.
Elsevier eBooksVision Paper
51 Citations2004Gagan Aggarwal, Mayank Bawa +9 more
It is suggested that data management solutions for information privacy must restore controls in the individual's hands, and that enabling such control will require a radical re-think on modeling, release, and management of personal data.
Preserving peer replicas by rate-limited sampled voting
47 Citations2003Petros Maniatis, David S. H. Rosenthal +4 more
The LOCKSS project presents a design for and simulations of a novel protocol for voting in systems of this kind that incorporates rate limitation and intrusion detection to ensure that even some very powerful adversaries attacking over many years have only a small probability of causing irrecoverable damage before being detected.
Addressing the Non-Cooperation Problem in Competitive P2P Systems
31 Citations2003Sepandar Kamvar, Beverly Yang +1 more
This work motivates why non-cooperation is likely to be a problem in these types of networks and presents an economic protocol to address this problem, called the RTR protocol, based on the buying and selling of the right-to-respond (RTR) to each query in the system.
Non-Cooperation in Competitive P2P Networks
29 Citations2005Bin‐Miao Yang, Tyson Condie +2 more
Through simulations, it is shown how the RTR protocol not only overcomes non-cooperation by providing proper incentives to peers, but also results in a network that is even more effective and efficient through intelligent, incentive-compatible routing of messages.
Pong-cache poisoning in GUESS
13 Citations2004Neil Daswani, Héctor García-Molina
This paper defines a simple, abstract model of a GUESS network, and describes how to limit pong cache poisoning, a condition in which the ids of malicious nodes appear in the pong caches of good nodes.