Home > Research > Publications & Outputs > Proofs of Writing for Robust Storage

Links

Text available via DOI:

View graph of relations

Proofs of Writing for Robust Storage

Research output: Contribution to journalJournal article

Published

Standard

Proofs of Writing for Robust Storage. / Dobre, Dan; Karame, Ghassan; Li, Wenting; Majuntke, Matthias ; Suri, Neeraj; Vukolic, Marko.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 30, No. 11, 27.05.2019, p. 2547-2566.

Research output: Contribution to journalJournal article

Harvard

Dobre, D, Karame, G, Li, W, Majuntke, M, Suri, N & Vukolic, M 2019, 'Proofs of Writing for Robust Storage', IEEE Transactions on Parallel and Distributed Systems, vol. 30, no. 11, pp. 2547-2566. https://doi.org/10.1109/TPDS.2019.2919285

APA

Dobre, D., Karame, G., Li, W., Majuntke, M., Suri, N., & Vukolic, M. (2019). Proofs of Writing for Robust Storage. IEEE Transactions on Parallel and Distributed Systems, 30(11), 2547-2566. https://doi.org/10.1109/TPDS.2019.2919285

Vancouver

Dobre D, Karame G, Li W, Majuntke M, Suri N, Vukolic M. Proofs of Writing for Robust Storage. IEEE Transactions on Parallel and Distributed Systems. 2019 May 27;30(11):2547-2566. https://doi.org/10.1109/TPDS.2019.2919285

Author

Dobre, Dan ; Karame, Ghassan ; Li, Wenting ; Majuntke, Matthias ; Suri, Neeraj ; Vukolic, Marko. / Proofs of Writing for Robust Storage. In: IEEE Transactions on Parallel and Distributed Systems. 2019 ; Vol. 30, No. 11. pp. 2547-2566.

Bibtex

@article{b8cea4f8435448e7b041c14fd8b92c7e,
title = "Proofs of Writing for Robust Storage",
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 (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 state of the art robust storage protocols, including protocols that tolerate only crash faults.",
author = "Dan Dobre and Ghassan Karame and Wenting Li and Matthias Majuntke and Neeraj Suri and Marko Vukolic",
year = "2019",
month = may,
day = "27",
doi = "10.1109/TPDS.2019.2919285",
language = "English",
volume = "30",
pages = "2547--2566",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "11",

}

RIS

TY - JOUR

T1 - Proofs of Writing for Robust Storage

AU - Dobre, Dan

AU - Karame, Ghassan

AU - Li, Wenting

AU - Majuntke, Matthias

AU - Suri, Neeraj

AU - Vukolic, Marko

PY - 2019/5/27

Y1 - 2019/5/27

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 state of the art robust storage protocols, including protocols that tolerate only crash faults.

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 state of the art robust storage protocols, including protocols that tolerate only crash faults.

U2 - 10.1109/TPDS.2019.2919285

DO - 10.1109/TPDS.2019.2919285

M3 - Journal article

VL - 30

SP - 2547

EP - 2566

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 11

ER -