Fast agreement in networks with Byzantine nodes
From MaRDI portal
Publication:6535029
DOI10.4230/lipics.disc.2020.30zbMath1540.68027MaRDI QIDQ6535029
Unnamed Author, Unnamed Author, Bogdan S. Chlebus
Publication date: 2 November 2023
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Robust gossiping with an application to consensus
- A bivalency proof of the lower bound for uniform consensus
- Easy impossibility proofs for distributed consensus problems
- A lower bound for the time to assure interactive consistency
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- A simple proof of the uniform consensus synchronous lower bound.
- Fault-Tolerant Consensus in Directed Graphs
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
- Authenticated Algorithms for Byzantine Agreement
- Byzantine Agreement Using Partial Authentication
- The topological structure of asynchronous computability
- Early stopping in Byzantine agreement
- Time and Communication Efficient Consensus for Crash Failures
- Scalable Quantum Consensus for Crash Failures
- Bounds on information exchange for Byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Impossibility Results for Distributed Computing
- Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
- Fast scalable deterministic consensus for crash failures
- Early-deciding consensus is expensive
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast agreement in networks with Byzantine nodes
