Recommendations
- Approximate agreement under mobile Byzantine faults
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Optimal mobile Byzantine fault tolerant distributed storage (extended abstract)
- Lower bound for scalable Byzantine agreement
- Tight bounds for connectivity and set agreement in Byzantine synchronous systems
Cites work
- A new solution for the Byzantine generals problem
- An O (log n ) expected rounds randomized byzantine generals protocol
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- An efficient algorithm for byzantine agreement without authentication
- Efficient algorithms for anonymous Byzantine agreement
- How to withstand mobile virus attacks (extended abstract)
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Self-stabilizing Byzantine agreement
- Structural Information and Communication Complexity
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Time is not a healer (preliminary version)
Cited in
(8)- Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
- Approximate agreement under mobile Byzantine faults
- Optimal mobile Byzantine fault tolerant distributed storage (extended abstract)
- Cooperative distributed state estimation: resilient topologies against smart spoofers
- Distributed CONGEST Algorithms against Mobile Adversaries
- Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
This page was built for publication: Tight bound on mobile Byzantine agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897904)
