Abstract
The original work on quorum systems assumed that servers fail benignly, by crashing or omitting some steps. More recently, researchers have developed techniques that enable quorum systems to provide data availability in the presence of arbitrary (Byzantine) faults [6]. Earlier work provides correct semantics despite server (i.e., replica) failures and also handles some of the problems of Byzantine clients [1,2,4,6, 9].
This paper describes the first protocols to handle all problems caused by Byzantine clients. Our protocols ensure that bad clients cannot interfere with good clients. Bad clients cannot prevent good clients from completing reads and writes, nor can they cause good clients to see inconsistencies. In addition bad clients that have been removed from operation can leave behind at most a bounded number of “lurking” writes that could be done on their behalf by a colluder.
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.: Optimal resilience for erasure-coded byzantine distributed storage. Technical Report RZ 3575, IBM Research (February 2005)
Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: Proc. 3rd OSDI (February 1999)
Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. In: Proc. of the International Conference on Dependable Systems and Networks (June 2004)
Liskov, B., Rodrigues, R.: Byzantine clients rendered harmless. Technical Report MIT-LCS-TR-994 and INESC-ID TR-10- (July 2005)
Malkhi, D., Reiter, M.: Byzantine Quorum Systems. Journal of Distributed Computing 11(4), 203–213 (1998)
Malkhi, D., Reiter, M.: Secure and scalable replication in phalanx. In: Proc. 17th SRDS (October 1998)
Malkhi, D., Reiter, M., Lynch, N.: A Correctness Condition for Memory Shared by Byzantine Processes (September 1998) (unpublished manuscript)
Martin, J., Alvisi, L., Dahlin, M.: Minimal Byzantine storage. Technical Report TR-02-38, University of Texas at Austin, Department of Computer Sciences (August 2002)
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
Liskov, B., Rodrigues, R. (2005). Byzantine Clients Rendered Harmless. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_35
Download citation
DOI: https://doi.org/10.1007/11561927_35
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)