Randomized algorithms
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Synchronous Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Probabilistic Byzantine quorum systems
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The Load and Availability of Byzantine Quorum Systems
SIAM Journal on Computing
Intrusion Detection
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Fault Detection for Byzantine Quorum Systems
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
Unreliable Intrusion Detection in Distributed Computations
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Distributed Computing
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
The case for Byzantine fault detection
HOTDEP'06 Proceedings of the 2nd conference on Hot Topics in System Dependability - Volume 2
PeerReview: practical accountability for distributed systems
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The case for byzantine fault detection
HotDep'06 Proceedings of the Second conference on Hot topics in system dependability
Behavioral distance for intrusion detection
RAID'05 Proceedings of the 8th international conference on Recent Advances in Intrusion Detection
Behavioral distance measurement using hidden markov models
RAID'06 Proceedings of the 9th international conference on Recent Advances in Intrusion Detection
| Hi-index | 0.00 |
In this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a system where each client accesses the replicated data at only a subset (quorum) of servers in each operation. In such a system, some correct servers can be out-of-date after a write and can therefore, return values other than the most up-to-date value in response to a client's read request, thus complicating the task of determining the number of faulty servers in the system at any point in time. We initiate the study of detecting server failures in this context, and propose two statistical approaches for estimating the risk posed by faulty servers based on responses to read requests.