Optimal Resilience for Erasure-Coded Byzantine Distributed Storage

Christian Cachin and Stefano Tessaro

Proc. Intl. Conference on Dependable Systems and Networks — DSN 2006, pp. 115–124, Jun 2006.

We analyze the problem of efficiently storing large amounts of data on a distributed set of servers that may be accessed concurrently from multiple clients by sending messages over an asynchronous network. Up to one third of the servers and an arbitrary number of clients may be faulty and exhibit Byzantine behavior. We provide the first simulation of a multiple-writer multiple-reader atomic read/write register using erasure-coding in this setting that achieves optimal resilience and minimal storage overhead. Additionally, we give the first implementation of non-skipping timestamps which provides optimal resilience and withstands Byzantine clients; it is based on threshold cryptography.

BibTeX Citation

@inproceedings{CacTes06,
    author       = {Christian Cachin and Stefano Tessaro},
    title        = {Optimal Resilience for Erasure-Coded Byzantine Distributed Storage},
    booktitle    = {Proc.~Intl. Conference on Dependable Systems and Networks --- DSN 2006},
    pages        = {115--124},
    year         = {2006},
    month        = {6},
}

Files and Links

There are currently no associated files available.