Early stopping in Byzantine agreement
From MaRDI portal
Publication:3495618
DOI10.1145/96559.96565zbMath0711.68008OpenAlexW2058777482MaRDI QIDQ3495618
Danny Dolev, H. Raymond Strong, K. Ruediger 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
reliabilitydistributed systemsfault toleranceasynchronous systemconsensus problemagreement problemcommit problem
Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (42)
Unbeatable consensus ⋮ On the round complexity of randomized Byzantine agreement ⋮ Common knowledge and consistent simultaneous coordination ⋮ Agreement under faulty interfaces ⋮ Synchronous condition-based consensus ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ The \(k\)-simultaneous consensus problem ⋮ The perfectly synchronized round-based model of distributed computing ⋮ The Firing Squad Problem Revisited. ⋮ Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds ⋮ Message-optimal protocols for Byzantine Agreement ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ No double discount: condition-based simultaneity yields limited gain ⋮ Multidimensional agreement in Byzantine systems ⋮ Consensus in the presence of mortal Byzantine faulty processes ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ Message and time efficient consensus protocols for synchronous distributed systems ⋮ The overhead of consensus failure recovery ⋮ A new solution for the Byzantine agreement problem ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ No Double Discount: Condition-Based Simultaneity Yields Limited Gain ⋮ Fast and simple distributed consensus ⋮ Optimal time byzantine agreement for t <n/8 with linear-messages ⋮ Hundreds of impossibility results for distributed computing ⋮ Modular construction of a Byzantine agreement protocol with optimal message bit complexity ⋮ Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement ⋮ The complexity of almost-optimal simultaneous coordination ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Efficient algorithms for anonymous Byzantine agreement ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ A topological treatment of early-deciding set-agreement ⋮ Simultaneity is harder than agreement ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound ⋮ The firing squad problem revisited ⋮ On the round complexity of Byzantine agreement without initial set-up ⋮ A bivalency proof of the lower bound for uniform consensus ⋮ A simple proof of the uniform consensus synchronous lower bound. ⋮ Efficient agreement using fault diagnosis.
This page was built for publication: Early stopping in Byzantine agreement
