Tolerating Byzantine Faulty Clients in a Quorum System
- 3 August 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Sharing memory with semi-Byzantine clients and faulty storage serversPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Non-skipping Timestamps for Byzantine Data Storage SystemsLecture Notes in Computer Science, 2004
- Efficient Byzantine-tolerant erasure-coded storagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Secure and scalable replication in PhalanxPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimal Byzantine StorageLecture Notes in Computer Science, 2002
- Byzantine quorum systemsDistributed Computing, 1998
- Axioms for concurrent objectsPublished by Association for Computing Machinery (ACM) ,1987
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979