Approximate agreement under mobile Byzantine faults
From MaRDI portal
Publication:1755583
DOI10.1016/j.tcs.2018.08.001zbMath1410.68029arXiv1604.03871OpenAlexW2338783699WikidataQ129360261 ScholiaQ129360261MaRDI QIDQ1755583
Antonella Del Pozzo, Sébastien Tixeuil, Silvia Bonomi, Maria Gradinariu Potop-Butucaru
Publication date: 10 January 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.03871
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Secure consensus with distributed detection via two-hop communication ⋮ Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Cites Work
- Unnamed Item
- Unnamed Item
- Multidimensional agreement in Byzantine systems
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Principles of distributed systems. 13th international conference, OPODIS 2009, Nîmes, France, December 15--18, 2009. Proceedings
- Easy impossibility proofs for distributed consensus problems
- Asynchronous approximate agreement
- Iterative approximate byzantine consensus in arbitrary directed graphs
- Asynchronous convex hull consensus in the presence of crash faults
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- A new solution for the Byzantine generals problem
- Reaching approximate agreement in the presence of faults
- The Byzantine Generals Problem
- Reaching Approximate Byzantine Consensus with Multi-hop Communication
- How to withstand mobile virus attacks (extended abstract)
- Multidimensional approximate agreement in Byzantine asynchronous systems
- Iterative Approximate Byzantine Consensus under a Generalized Fault Model
This page was built for publication: Approximate agreement under mobile Byzantine faults
