Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Efficient Remote Data Possession Checking in Critical Information Infrastructures
IEEE Transactions on Knowledge and Data Engineering
Reputation and audits for self-organizing storage
Proceedings of the workshop on Security in Opportunistic and SOCial networks
| Hi-index | 0.00 |
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.