Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - PoWerStore
T2 - Proofs of writing for efficient and robust storage
AU - Dobre, D.
AU - Karame, G.
AU - Li, W.
AU - Majuntke, M.
AU - Suri, Neeraj
AU - Vukolić, M.
PY - 2013/11/4
Y1 - 2013/11/4
N2 - 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 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. © 2013 ACM.
AB - 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 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. © 2013 ACM.
KW - byzantine-fault tolerance
KW - secure distributed storage
KW - strong consistency
KW - Byzantine fault tolerance
KW - Distributed storage
KW - Efficient implementation
KW - High availability
KW - Light-weight cryptography
KW - Read/write operations
KW - Storage solutions
KW - Strong consistency
KW - Digital storage
KW - Distributed computer systems
KW - Metadata
KW - Security of data
KW - Carbon capture
U2 - 10.1145/2508859.2516750
DO - 10.1145/2508859.2516750
M3 - Conference contribution/Paper
SN - 9781450324779
SP - 285
EP - 297
BT - Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
PB - ACM
ER -