Optimal resilience for erasure-coded byzantine distributed storage

Authors:
Christian Cachin;Stefano Tessaro
Affiliations:
Zurich Research Laboratory, IBM Research, Rüschlikon, Switzerland;Department of Computer Science, ETH Zurich, Zürich, Switzerland
Venue:
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Year:
2005

Citing 5
Cited 0

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Minimal Byzantine Storage

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Efficient Byzantine-Tolerant Erasure-Coded Storage

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Asynchronous Veri.able Information Dispersal

SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Practical threshold signatures

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider distributed storage systems implemented by a set of n servers and accessed by a possibly unbounded set of clients, for reading and writing data. Servers and clients communicate by exchanging messages over a fully connected asynchronous network. This model is suitable for heterogeneous and wide-area networks, and, furthermore, avoids timing assumptions, which may otherwise become a vulnerability of the system. We consider Byzantine failures and assume that up to t servers and any number of clients may deviate from the protocol in an arbitrary way.