Validating Peer-to-Peer Storage Audits with Evolutionary Game Theory

This paper discusses the efficiency of audits as incentives for reducing free-riding in P2P storage applications, that is, lessening the number of peers that can store their data without contributing to the storage infrastructure. Audits are remote data verifications that can also be used to decide whether to cooperate with a given peer based on its behavior. We demonstrate how an audit-based strategy can dominate or outperform the free-riding strategy by exhibiting the equilibria of our evolutionary game theoretical model of a P2P storage application.

[1]  D. S. Jones,et al.  Differential Equations and Mathematical Biology , 1983 .

[2]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.

[3]  Sushil Jajodia,et al.  Integrity and internal control on information systems VI : IFIP TC11/WG11.5 Sixth Working Conference on Integrity and Internal Control in Information Systems (IICIS), 13-14 November 2003, Lausanne, Switzerland , 2004 .

[4]  Pietro Michiardi,et al.  A Game Theoretic Model of a Protocol for Data Possession Verification , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[5]  Karl Sigmund,et al.  The good, the bad and the discriminator--errors in direct and indirect reciprocity. , 2006, Journal of theoretical biology.

[6]  Yves Roudier,et al.  Reputation and audits for self-organizing storage , 2008, SOSOC '08.

[7]  D. Friedman.  On economic applications of evolutionary game theory , 1998 .

[8]  Yves Roudier,et al.  Securing Ad Hoc Storage through , 2007 .

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

[10]  Jean-Jacques Quisquater,et al.  Remote Integrity Checking - How to Trust Files Stored on Untrusted Servers , 2003, IICIS.

[11]  Josep Domingo-Ferrer,et al.  Efficient Remote Data Possession Checking in Critical Information Infrastructures , 2008, IEEE Transactions on Knowledge and Data Engineering.

[12]  Paulo S. L. M. Barreto,et al.  Demonstrating data possession and uncheatable data transfer , 2006, IACR Cryptol. ePrint Arch..

[13]  Ethan L. Miller,et al.  Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[14]  Ari Juels,et al.  Pors: proofs of retrievability for large files , 2007, CCS '07.