On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

DOI10.1007/978-3-540-75142-7_17zbMath1145.68351OpenAlexW1520594164MaRDI QIDQ3523208

Ezra N. Hoch, Danny Dolev

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_17

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Synchronous counting and computational algorithm design, Efficient Counting with Optimal Resilience, Self-stabilizing Byzantine asynchronous unison, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Dynamic FTSS in asynchronous systems: the case of unison, Near-optimal self-stabilising counting and firing squads