Early stopping in Byzantine agreement
From MaRDI portal
Publication:3495618
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
Cited in
(54)- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Early stopping Byzantine agreement in (1+ ) f rounds
- 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
- Consensus in the presence of mortal Byzantine faulty processes
- The bitcoin backbone protocol: analysis and applications
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
- Unbeatable consensus
- On the round complexity of randomized Byzantine agreement
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Message-optimal protocols for Byzantine Agreement
- Hundreds of impossibility results for distributed computing
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Message and time efficient consensus protocols for synchronous distributed systems
- Narrowing Power vs. Efficiency in Synchronous Set Agreement
- Agreement under faulty interfaces
- Early-deciding consensus is expensive
- A new solution for the Byzantine generals problem
- Fast and simple distributed consensus
- 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
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- The Heard-Of model: computing in distributed systems with benign faults
- Fast agreement in networks with Byzantine nodes
- 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.
- Multidimensional agreement in Byzantine systems
- Synchronous condition-based consensus
- The overhead of consensus failure recovery
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Probabilistic Termination and Composability of Cryptographic Protocols
- Early stopping for any number of corruptions
- Proof-of-work-based consensus in expected-constant time
- 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
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- On the round complexity of Byzantine agreement without initial set-up
- Efficient agreement using fault diagnosis.
- A new solution for the Byzantine agreement problem
- How to Solve Consensus in the Smallest Window of Synchrony
- Asymptotically optimal early termination for dishonest majority broadcast
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- 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)
