Robust accounting in decentralized P2P storage systems

Ivan Osipkov, Peng Wang, Nicholas Hopper, Yongdae Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

A peer-to-peer (P2P) storage system allows a network of peer computers to increase the availability of their data by replicating it on other peers in the network. In such networks, a central challenge is preventing "freeloaders", or nodes that use disproportionately more storage on other peers than they contribute to the network. While several existing systems claim to solve this problem, we show that all known approaches are vulnerable to various attacks by either a single greedy peer or a small group of peers. To address this problem, we describe a robust distributed system to account for the storage activities of each peer. We analyze the security of this system, prove that it is secure under a much stronger attack model than previous work, and evaluate the efficiency of a prototype implementation.

Original languageEnglish (US)
Title of host publication26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages14-23
Number of pages10
ISBN (Print)0769525407, 9780769525402
DOIs
StatePublished - 2006
Event26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006 - Lisboa, Portugal
Duration: Jul 4 2006Jul 7 2006

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume2006

Other

Other26th IEEE Internationa26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006
CountryPortugal
CityLisboa
Period7/4/067/7/06

Fingerprint Dive into the research topics of 'Robust accounting in decentralized P2P storage systems'. Together they form a unique fingerprint.

Cite this