Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
CSC '91 Proceedings of the 19th annual conference on Computer Science
Abstractions for mobile computations
Secure Internet programming
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Muteness Failure Detectors: Specification and Implementation
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Optimal Unconditional Information Diffusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Ruminations on Domain-Based Reliable Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
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
A High-Throughput Secure Reliable Multicast Protocol
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A Consensus Protocol for CAN-Based Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Secure reliable multicast protocols in a WAN
Distributed Computing
Necessary and sufficient conditions for broadcast consensus protocols
Distributed Computing
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
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
On fairness in simulatability-based cryptographic systems
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Low complexity Byzantine-resilient consensus
Distributed Computing
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
Flexible intrusion tolerant voting architecture
Proceedings of the 2007 ACM workshop on Scalable trusted computing
Automated Rule-Based Diagnosis through a Distributed Monitor System
IEEE Transactions on Dependable and Secure Computing
Experience with Feedback Control Mechanisms in Self-replicating Multi-Agent Systems
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Hardening Botnet by a Rational Botmaster
Information Security and Cryptology
Tolerating latency in replicated state machines through client speculation
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Intrusion-tolerant architectures: concepts and design
Architecting dependable systems
Towards a practical approach to confidential Byzantine fault tolerance
Future directions in distributed computing
Prophecy: using history for high-throughput fault tolerance
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Independent faults in the cloud
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
MPSS: Mobile Proactive Secret Sharing
ACM Transactions on Information and System Security (TISSEC)
Communication optimal multi-valued asynchronous broadcast protocol
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th 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
Fault Reporting in Partially Known Networks and Folk Theorems
Operations Research
Quantum Information & Computation
On the performance of a retransmission-based synchronizer
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
SITIS: scalable intrusion tolerance middleware for internet service survivability
PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Improving server applications with system transactions
Proceedings of the 7th ACM european conference on Computer Systems
Verifiable agreement: limits of non-repudiation in mobile peer-to-peer ad hoc networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
On the price of equivocation in byzantine agreement
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Proving termination of probabilistic programs using patterns
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Distributing trusted third parties
ACM SIGACT News
On the performance of a retransmission-based synchronizer
Theoretical Computer Science
| Hi-index | 0.01 |
A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes that can also send false messages. The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability 1 for these systems are investigated. With fail-stop processes, it is shown that ⌈(n + 1)/2⌉ correct processes are necessary and sufficient to reach agreement. In the malicious case, it is shown that ⌈(2n + 1)/3⌉ correct processes are necessary and sufficient to reach agreement. This is contrasted with an earlier result, stating that there is no consensus protocol for the fail-stop case that always terminates within a bounded number of steps, even if only one process can fail. The possibility of reliable broadcast (Byzantine Agreement) in asynchronous systems is also investigated. Asynchronous Byzantine Agreement is defined, and it is shown that ⌈(2n + 1)/3⌉ correct processes are necessary and sufficient to achieve it.