Early stopping in Byzantine agreement
DOI10.1145/96559.96565zbMATH Open0711.68008OpenAlexW2058777482MaRDI QIDQ3495618FDOQ3495618
Authors: Danny Dolev, H. Raymond Strong, Rüdiger Reischuk 
Publication date: 1990
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/96559.96565
Recommendations
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Message-optimal protocols for Byzantine Agreement
- scientific article; zbMATH DE number 2051906
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- Bounds on information exchange for Byzantine agreement
reliabilitydistributed systemsfault toleranceasynchronous systemconsensus problemagreement problemcommit problem
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network design and communication in computer systems (68M10)
Cited In (50)
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- A topological treatment of early-deciding set-agreement
- The complexity of almost-optimal simultaneous coordination
- No double discount: condition-based simultaneity yields limited gain
- Probabilistic termination and composability of cryptographic protocols
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Unbeatable consensus
- On the round complexity of randomized Byzantine agreement
- Message-optimal protocols for Byzantine Agreement
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
- Consensus in the presence of mortal Byzantine faulty processes
- Hundreds of impossibility results for distributed computing
- Narrowing Power vs. Efficiency in Synchronous Set Agreement
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Message and time efficient consensus protocols for synchronous distributed systems
- Agreement under faulty interfaces
- Early-deciding consensus is expensive
- A new solution for the Byzantine generals problem
- Fast and simple distributed consensus
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- Common knowledge and consistent simultaneous coordination
- The perfectly synchronized round-based model of distributed computing
- A bivalency proof of the lower bound for uniform consensus
- Fast agreement in networks with Byzantine nodes
- The Heard-Of model: computing in distributed systems with benign faults
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Simplicial models for the epistemic logic of faulty agents
- Simultaneity is harder than agreement
- A simple proof of the uniform consensus synchronous lower bound.
- Synchronous condition-based consensus
- The overhead of consensus failure recovery
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Multidimensional agreement in Byzantine systems
- Early stopping for any number of corruptions
- Proof-of-work-based consensus in expected-constant time
- Probabilistic Termination and Composability of Cryptographic Protocols
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Efficient agreement using fault diagnosis.
- On the round complexity of Byzantine agreement without initial set-up
- How to Solve Consensus in the Smallest Window of Synchrony
- A new solution for the Byzantine agreement problem
- No Double Discount: Condition-Based Simultaneity Yields Limited Gain
- Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
- Efficient algorithms for anonymous Byzantine agreement
- The firing squad problem revisited
- The firing squad problem revisited
- The \(k\)-simultaneous consensus problem
This page was built for publication: Early stopping in Byzantine agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495618)
