Reputation and audits for self-organizing storage

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.

[1]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[2]  David K. Y. Yau,et al.  Distributed collaborative key agreement and authentication protocols for dynamic peer groups , 2006, TNET.

[3]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[4]  Valérie Viet Triem Tong,et al.  Contrôle d'accès distribué à un réseau pair-à-pair , 2007 .

[5]  Michael Burrows,et al.  A Cooperative Internet Backup Scheme , 2003, USENIX Annual Technical Conference, General Track.

[6]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[7]  Melek Önen,et al.  A Security Protocol for Self-Organizing Data Storage , 2008, SEC.

[8]  Valérie Viet Triem Tong,et al.  A sybilproof distributed identity management for P2P networks , 2008, 2008 IEEE Symposium on Computers and Communications.

[9]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[10]  Robin I. M. Dunbar CO-EVOLUTION OF NEOCORTEX SIZE , GROUP SIZE AND LANGUAGE IN HUMANS , 2008 .

[11]  Arun Venkataramani,et al.  Do incentives build robustness in bit torrent , 2007 .

[12]  Robert Tappan Morris,et al.  Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.

[13]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[14]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[15]  Robin I. M. Dunbar Coevolution of neocortical size, group size and language in humans , 1993, Behavioral and Brain Sciences.

[16]  Roger Dingledine,et al.  The Free Haven Project : design and deployment of an anonymous secure data haven , 2000 .

[17]  CastroMiguel,et al.  Secure routing for structured peer-to-peer overlay networks , 2002 .

[18]  Emmanuelle Anceaume,et al.  Incentive-Based Robust Reputation Mechanism for P2P Services , 2006, OPODIS.