Nouha Oualha
ABSTRACT
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.
- AllMydata web site: http://www.allmydata.com/Google Scholar
- AllMyData Tahoe: http://allmydata.org/trac/tahoe/Google Scholar
- Wuala web site: http://wua.la/en/home.htmlGoogle Scholar
- Ubistorage web site: http://www.ubistorage.com/Google Scholar
- Nouha Oualha, Melek Önen, and Yves Roudier, "A Security Protocol for Self-Organizing Data Storage", to appear in IFIP Sec 2008.Google Scholar
- Nouha Oualha, Melek Önen, and Yves Roudier, "A Security Protocol for Self-Organizing Data Storage", (extended version) Technical Report N° RR-08-208, EURECOM, January 2008.Google Scholar
- Patrick P. C. Lee, John C. S. Lui and David K. Y. Yau, "Distributed collaborative key agreement and authentication protocols for dynamic peer group", IEEE/ACM Transactions on Networking, 2006 Google ScholarDigital Library
- François Lesueur, Ludovic Mé, Valérie Viet Triem Tong, "Contrôle d'accès distribué à un réseau Pair-à-Pair", SAR-SSI 2007, Annecy, France.Google Scholar
- François Lesueur, Ludovic Mé, and Valérie Viet Triem Tong, "A Sybilproof Distributed Identity Management for P2P Networks", Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC) 2008, IEEE Computer Society, Marrakech, Morocco.Google Scholar
- Roger R. Dingledine, "The Free Haven project: Design and deployment of an anonymous secure data haven", Master's thesis, MIT, June 2000.Google Scholar
- Mark Lillibridge, Sameh Elnikety, Andrew Birrell, and Mike Burrows, "A Cooperative Internet Backup Scheme", In Proceedings of the 2003 Usenix Annual Technical Conference, pp. 29--41, San Antonio, Texas, June 2003. Google ScholarDigital Library
- Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker, "A scalable content-addressable network", In Proceedings of SIGCOMM, San Diego, CA, Aug. 27--31, 2001. Google ScholarDigital Library
- Antony Rowstron and Peter Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", In IFIP/ACMInternational Conference on Distributed Systems Platforms, Heidelberg, Germany, Nov. 2001. Google ScholarDigital Library
- Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications", In Proceedings of SIGCOMM, San Diego, CA, Aug. 27--31, 2001. Google ScholarDigital Library
- Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing", Technical Report UCB//CSD-01-1141, University of California, Berkeley, Apr. 2000 Google ScholarDigital Library
- Emmanuelle Anceaume and Aina Ravoaja, "Incentive-Based Robust Reputation Mechanism for P2P Services", Research Report PI 1816 (2006), IRISA, http://hal.inria.fr/inria-00121609/fr/ Google ScholarDigital Library
- Emil Sit and Robert Morris, "Security Considerations for P2P Distributed Hash Tables", IPTPS 2002. Google ScholarDigital Library
- Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron and Dan S. Wallach, "Secure routing for structured peer-to-peer overlay networks", Symposium on Operating Systems and Implementation, OSDI'02, Boston, MA, December 2002. Google ScholarDigital Library
- Michael Piatek, Tomas Isdal, Thomas Anderson, and Arvind Krishnamurthy, "Do incentives build robustness in BitTorrent?", In Proceedings of the ACM/USENIX Fourth Symposium on Networked Systems Design and Implementation (NSDI 2007), 2007. Google ScholarDigital Library
- Robin I. M. Dunbar, "Co-Evolution of Neocortex Size, Group Size and Language in Human", Behavioral and Brain Sciences 16 (1993), no. 4, pp. 681--735.Google Scholar
Index Terms
- Reputation and audits for self-organizing storage
Recommendations
The Eigentrust algorithm for reputation management in P2P networks
WWW '03: Proceedings of the 12th international conference on World Wide WebPeer-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 ...
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 ...
New metrics for reputation management in P2P networks
AIRWeb '07: Proceedings of the 3rd international workshop on Adversarial information retrieval on the webIn 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 ...
Comments