On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

DOI10.1007/978-3-540-75142-7_17MaRDI QIDQ3523208zbMATH OpenOpenAlexFDO

Authors Danny Dolev, Ezra N. Hoch

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)

Recommendations

• Self-stabilization of Byzantine Protocols
• Self-stabilizing Byzantine agreement
• Synthesis of self-stabilising and Byzantine-resilient distributed systems
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Self-stabilizing Byzantine asynchronous unison
• Byzantine Fault Detectors for Solving Consensus
• A self-adjusting algorithm for Byzantine agreement
• Asynchronous Byzantine agreement with optimal resilience

Cited in

(12)

• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
• Fast self-stabilizing Byzantine tolerant digital clock synchronization
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• scientific article; zbMATH DE number 2061537 (Why is no real title available?)
• Self-stabilizing Byzantine asynchronous unison
• Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
• Self-stabilization of Byzantine Protocols
• Efficient counting with optimal resilience
• Principles of Distributed Systems
• Dynamic FTSS in asynchronous systems: the case of unison
• Near-optimal self-stabilising counting and firing squads
• Synchronous counting and computational algorithm design

This page was built for publication: On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523208)