TU Darmstadt / ULB / TUbiblio

PoWerStore: Proofs of Writing for Efficient and Robust Storage

Dobre, Dan ; Karame, Ghassan O. ; Li, Wenting ; Majuntke, Matthias ; Suri, Neeraj ; Vukolic, Marko (2013)
PoWerStore: Proofs of Writing for Efficient and Robust Storage.
Berlin, Germany
doi: 10.1145/2508859.2516750
Conference or Workshop Item, Bibliographie

Abstract

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 (waitfreedom) and strong consistency (linearizability) of read- /write operations. PoWerStore’s efficiency 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 first round writes the actual data and the second round only serves to “prove” the occurrence of the first round. PoW enable efficient 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.

Item Type: Conference or Workshop Item
Erschienen: 2013
Creators: Dobre, Dan ; Karame, Ghassan O. ; Li, Wenting ; Majuntke, Matthias ; Suri, Neeraj ; Vukolic, Marko
Type of entry: Bibliographie
Title: PoWerStore: Proofs of Writing for Efficient and Robust Storage
Language: German
Date: November 2013
Publisher: ACM
Book Title: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Series: CCS '13
Event Location: Berlin, Germany
DOI: 10.1145/2508859.2516750
Abstract:

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 (waitfreedom) and strong consistency (linearizability) of read- /write operations. PoWerStore’s efficiency 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 first round writes the actual data and the second round only serves to “prove” the occurrence of the first round. PoW enable efficient 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.

Uncontrolled Keywords: byzantine-fault tolerance, secure distributed storage, strong consistency
Identification Number: TUD-CS-2013-0474
Divisions: Profile Areas
Profile Areas > Cybersecurity (CYSEC)
Date Deposited: 28 Aug 2017 11:32
Last Modified: 22 Jan 2019 10:35
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details