How to assign votes in a distributed system
Journal of the ACM (JACM)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Integrating security with fault-tolerant distributed databases
The Computer Journal - Special issue on databases
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A bound first-in, first-enabled solution to the 1-exclusion problem
Proceedings of the 4th international workshop on Distributed algorithms
Optimal multi-writer multi-reader atomic register
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Authentication in distributed systems: theory and practice
ACM Transactions on Computer Systems (TOCS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
How to share concurrent wait-free variables
Journal of the ACM (JACM)
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The load and availability of Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Synchronous Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
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, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Storage Efficient and Secure Replicated Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
How to Make Replicated Data Secure
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Secure and Scalable Replication in Phalanx
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Distributed Computing
Distributed Computing
A framework for semantic reasoning about Byzantine quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Fault Detection for Byzantine Quorum Systems
IEEE Transactions on Parallel and Distributed Systems
Information and Computation
COCA: A secure distributed online certification authority
ACM Transactions on Computer Systems (TOCS)
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Byzantine quorum systems with maximum availabililty
Information Processing Letters
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Primary Configuration Group Communication Service
Proceedings of the 13th International Symposium on Distributed Computing
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Preserving peer replicas by rate-limited sampled voting
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Brief announcement: reconfigurable byzantine-fault-tolerant atomic memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
CODEX: A Robust and Secure Secret Distribution System
IEEE Transactions on Dependable and Secure Computing
Practical secret sharing scheme realizing generalized adversary structure
Journal of Computer Science and Technology
Secure reliable multicast protocols in a WAN
Distributed Computing
Synchronous Byzantine quorum systems
Distributed Computing
The LOCKSS peer-to-peer digital preservation system
ACM Transactions on Computer Systems (TOCS)
Defending a P2P Digital Preservation System
IEEE Transactions on Dependable and Secure Computing
Access cost for asynchronous Byzantine quorum systems
Distributed Computing
APSS: proactive secret sharing in asynchronous systems
ACM Transactions on Information and System Security (TISSEC)
Implementing Trustworthy Services Using Replicated State Machines
IEEE Security and Privacy
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks
IEEE Transactions on Dependable and Secure Computing
BTS: a Byzantine fault-tolerant tuple space
Proceedings of the 2006 ACM symposium on Applied computing
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Randomized registers and iterative algorithms
Distributed Computing
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Wait-free regular storage from Byzantine components
Information Processing Letters
Worm-IT - A wormhole-based intrusion-tolerant group communication system
Journal of Systems and Software
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Attrition defenses for a peer-to-peer digital preservation system
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
A Parsimonious Approach for Obtaining Resource-Efficient and Trustworthy Execution
IEEE Transactions on Dependable and Secure Computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Nysiad: practical protocol transformation to tolerate Byzantine failures
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Research note: On Byzantine generals with alternative plans
Journal of Parallel and Distributed Computing
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Optimizing Threshold Protocols in Adversarial Structures
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the Time-Complexity of Robust and Amnesic Storage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Low-latency access to robust amnesic storage
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
ACM SIGACT News
Open-source grid technologies for web-scale computing
ACM SIGACT News
Tolerating latency in replicated state machines through client speculation
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Proactive Byzantine Quorum Systems
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Proxy agent based replication control model for wireless internet
Information Sciences: an International Journal
Greedy cheating liars and the fools who believe them
ESOA'06 Proceedings of the 4th international conference on Engineering self-organising systems
The building blocks of consensus
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Practical impact of group communication theory
Future directions in distributed computing
Towards a practical approach to confidential Byzantine fault tolerance
Future directions in distributed computing
ACM Transactions on Computer Systems (TOCS)
HotDep'10 Proceedings of the Sixth international conference on Hot topics in system dependability
Depot: cloud storage with minimal trust
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Distributed double spending prevention
Proceedings of the 15th international conference on Security protocols
DepSky: dependable and secure storage in a cloud-of-clouds
Proceedings of the sixth conference on Computer systems
Validity bound of regular registers with churn and byzantine processes
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multi-writer regular registers in dynamic distributed systems with byzantine failures
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
An algorithm for implementing BFT registers in distributed systems with bounded churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Depot: Cloud Storage with Minimal Trust
ACM Transactions on Computer Systems (TOCS)
ACM SIGACT News
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
Protecting secret data from insider attacks
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Byzantine clients rendered harmless
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Parsimony-Based approach for obtaining resource-efficient and trustworthy execution
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
DSO: dependable signing overlay
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
State machine replication with byzantine faults
Replication
Fork-Consistent constructions from registers
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Churn Tolerance Algorithm for State Machine Replication
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
Augustus: scalable and robust storage for cloud applications
Proceedings of the 8th ACM European Conference on Computer Systems
Distributing trusted third parties
ACM SIGACT News
Assessing data availability of Cassandra in the presence of non-accurate membership
Proceedings of the 2nd International Workshop on Dependability Issues in Cloud Computing
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
ACM Transactions on Storage (TOS)
A protocol for implementing byzantine storage in churn-prone distributed systems
Theoretical Computer Science
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
Hi-index | 0.00 |
Quorum systems are well-known tools for ensuring the consistency and availability of replicated data despite the benign failure of data repositories. In this paper we consider the arbitrary (Byzantine) failure of data repositories and present the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures. We also consider the load associated with our quorum systems, i.e., the minimal access probability of the busiest server. For services subject to arbitrary failures, we demonstrate quorum systems over n servers with a load of O(1/√n), thus meeting the lower bound on load for benignly fault-tolerant quorum systems. We explore several variations of our quorum systems and extend our constructions to cope with arbitrary client failures.