Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Distributed collaborative key agreement and authentication protocols for dynamic peer groups
IEEE/ACM Transactions on Networking (TON)
A cooperative internet backup scheme
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Incentive-based robust reputation mechanism for p2p services
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Validating Peer-to-Peer Storage Audits with Evolutionary Game Theory
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Securing P2P storage with a self-organizing payment scheme
DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
| Hi-index | 0.00 |
Reputation systems have demonstrated their interest in stimulating cooperation in peer-to-peer (P2P) systems. Their key operation relies on collecting, processing, and disseminating the feedback about some peers' past behavior in order to boost their cooperation, albeit this is susceptible to collusion and bashing. Additionally, estimating reputation generally relies on a partial assessment of the behavior of peers only, which might delay the detection of selfish peers. This situation is rendered even worse in self-organized storage applications, since storage is not an instantaneous operation and data are vulnerable throughout their entire storage lifetime. This paper compares reputation to an audit-based approach where peer observations are carried out through the periodic verification of a proof of data possession, and shows how the latter approach better addresses the aforementioned issues of inciting cooperation in P2P storage.