Probabilistic Byzantine quorum systems
- 1 January 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
In this paper we present probabilistic masking quorum systems, a technique for replicating data that can mask, with high probability, the arbitrary (Byzantine) failure of data servers from clients. This technique generalizes previous work on probabilistic quorum systems to mask Byzantine server failures in their full generality, and improves over previous masking quorum systems by offering better data availability and access efficiency. We define probabilistic masking quorum systems,...This publication has 0 references indexed in Scilit: