Tight bound on mobile Byzantine agreement
From MaRDI portal
Publication:897904
DOI10.1016/J.TCS.2015.10.019zbMath1331.68030OpenAlexW1773531469MaRDI QIDQ897904
Xavier Défago, François Bonnet, Thanh Dang Nguyen, Maria Gradinariu Potop-Butucaru
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.019
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Cooperative distributed state estimation: resilient topologies against smart spoofers ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
Cites Work
- Efficient algorithms for anonymous Byzantine agreement
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- A new solution for the Byzantine generals problem
- Impossibility of distributed consensus with one faulty process
- An O (log n ) expected rounds randomized byzantine generals protocol
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- An efficient algorithm for byzantine agreement without authentication
- Time is not a healer
- Self-stabilizing byzantine agreement
- How to withstand mobile virus attacks (extended abstract)
- Structural Information and Communication Complexity
This page was built for publication: Tight bound on mobile Byzantine agreement
