Establishing Trust in Distributed Storage Providers

2003
Caronni, Germano
Publication type
Contribution to a conference collection
Published in
Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003). - IEEE Comput. Soc, 2003. - pp. 128-133. - ISBN 0-7695-2023-5
Abstract
Corporate IT as well as individuals show increasing interest in reliable outsourcing of storage infrastructure. Decentralized solutions with their resilience against partial outages are among the most attractive approaches. Irrespective of the form of the relationship, be it based on a contract or on the more flexible cooperative model, the problem of verifying whether someone promising to store one's data actually does so remains to be solved, especially in the presence of multiple replicas. In this paper, we introduce a lightweight mechanism that allows the data originator or a dedicated verification agent to build up trust in the replica holder by means of protocols that do not require prior trust or key establishment. We show how naive versions of the protocol do not prevent cheating, and then strengthen it by adding means that make it economically attractive to be honest. This provides a foundation for further work in providing trustworthy distributed storage.
Subject (DDC)
004 Computer Science
Conference
Third International Conference on Peer-to-Peer Computing (P2P2003), Linkoping, Sweden
Cite This
ISO 690CARONNI, Germano, Marcel WALDVOGEL, 2003. Establishing Trust in Distributed Storage Providers. Third International Conference on Peer-to-Peer Computing (P2P2003). Linkoping, Sweden. In: Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003). IEEE Comput. Soc, pp. 128-133. ISBN 0-7695-2023-5. Available under: doi: 10.1109/PTP.2003.1231512
BibTex
@inproceedings{Caronni2003Estab-6287,
year={2003},
doi={10.1109/PTP.2003.1231512},
title={Establishing Trust in Distributed Storage Providers},
isbn={0-7695-2023-5},
publisher={IEEE Comput. Soc},
booktitle={Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003)},
pages={128--133},
author={Caronni, Germano and Waldvogel, Marcel}
}

RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<dc:contributor>Caronni, Germano</dc:contributor>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6287"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:issued>2003</dcterms:issued>
<dc:contributor>Waldvogel, Marcel</dc:contributor>
<dc:language>eng</dc:language>
<dc:format>application/pdf</dc:format>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6287/1/caronni03establishing.pdf"/>
<dcterms:bibliographicCitation>Also publ. in: Third IEEE International Conference on Peer-to-Peer Computing (P2P 2003), September 2003.</dcterms:bibliographicCitation>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:10Z</dcterms:available>
<dc:creator>Waldvogel, Marcel</dc:creator>
<dcterms:abstract xml:lang="eng">Corporate IT as well as individuals show increasing interest in reliable outsourcing of storage infrastructure. Decentralized solutions with their resilience against partial outages are among the most attractive approaches. Irrespective of the form of the relationship, be it based on a contract or on the more flexible cooperative model, the problem of verifying whether someone promising to store one's data actually does so remains to be solved, especially in the presence of multiple replicas. In this paper, we introduce a lightweight mechanism that allows the data originator or a dedicated verification agent to build up trust in the replica holder by means of protocols that do not require prior trust or key establishment. We show how naive versions of the protocol do not prevent cheating, and then strengthen it by adding means that make it economically attractive to be honest. This provides a foundation for further work in providing trustworthy distributed storage.</dcterms:abstract>