Ecole d'ingénieur et centre de recherche en Sciences du numérique

PoWerStore: proofs of writing for robust and efficient storage

Dobre, Dan; Karame, Ghassan O; Li, Wenting; Majuntke, Matthias; Suri, Neeraj; Vukolic, Marko

CCS 2013, 20th ACM Conference on Computer and Communications Security, 4-7 November 2013, Berlin, Germany

Existing Byzantine fault tolerant (BFT) storage solutions that achieve strong consistency and high availability, are costly compared to solutions that tolerate simple crashes. This cost is one of the main obstacles in deploying BFT storage in practice. In this paper, we present PoWerStore, a robust and efficient data storage protocol. PoWerStore's robustness comprises tolerating network outages, maximum number of Byzantine storage servers, any number of Byzantine readers and crash-faulty writers, and guaranteeing high availability (wait-freedom) and strong consistency (linearizability) of read-/write operations. PoWerStore's eciency stems from combining lightweight cryptography, erasure coding and metadata write-backs, where readers write-back only metadata to achieve strong consistency. Central to PoWerStore is the concept of \Proofs of Writing" (PoW), a novel data storage technique inspired by commitment schemes. PoW rely on a 2-round write procedure, in which the rst round writes the actual data and the second round only serves to \prove" the occurrence of the rst round. PoW enable ecient implementations of strongly consistent BFT storage through metadata write-backs and low latency reads. We implemented PoWerStore and show its improved performance when compared to existing robust storage protocols, including protocols that tolerate only crash faults.

Document Doi Bibtex

Titre:PoWerStore: proofs of writing for robust and efficient storage
Mots Clés:Byzantine-Fault Tolerance; Secure Distributed Storage; Strong Consistency
Type:Conférence
Langue:English
Ville:Berlin
Pays:ALLEMAGNE
Date:
Département:Sécurité numérique
Eurecom ref:4146
Copyright: © ACM, 2013. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in CCS 2013, 20th ACM Conference on Computer and Communications Security, 4-7 November 2013, Berlin, Germany http://dx.doi.org/10.1145/2508859.2516750
Bibtex: @inproceedings{EURECOM+4146, doi = {http://dx.doi.org/10.1145/2508859.2516750}, year = {2013}, title = {{P}o{W}er{S}tore: proofs of writing for robust and efficient storage}, author = {{D}obre, {D}an and {K}arame, {G}hassan {O} and {L}i, {W}enting and {M}ajuntke, {M}atthias and {S}uri, {N}eeraj and {V}ukolic, {M}arko}, booktitle = {{CCS} 2013, 20th {ACM} {C}onference on {C}omputer and {C}ommunications {S}ecurity, 4-7 {N}ovember 2013, {B}erlin, {G}ermany}, address = {{B}erlin, {ALLEMAGNE}}, month = {11}, url = {http://www.eurecom.fr/publication/4146} }
Voir aussi: