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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bazzi, R., Ding, Y.: Non-skipping timestamps for Byzantine data storage systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 405–419. Springer, Heidelberg (2004)
Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Proc. 24th Symp. on Reliable Distributed Systems (SRDS 2005) (October 2005)
Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded Byzantine distributed storage. Research Report RZ 3575, IBM Research (February 2005)
Goodson, G.R., Wylie, J.J., Ganger, G.R., Reiter, M.K.: Efficient Byzantine-tolerant erasure-coded storage. In: Proc. International Conference on Dependable Systems and Networks (DSN 2004), pp. 135–144 (2004)
Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal Byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 311–325. Springer, Heidelberg (2002)
Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM 36(2), 335–348 (1989)
Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cachin, C., Tessaro, S. (2005). Optimal Resilience for Erasure-Coded Byzantine Distributed Storage. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_39
Download citation
DOI: https://doi.org/10.1007/11561927_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)