Fast self-stabilizing Byzantine tolerant digital clock synchronization

DOI10.1145/1400751.1400802MaRDI QIDQ2934362zbMATH OpenOpenAlexFDO

Authors Michael Ben-Or, Danny Dolev, Ezra N. Hoch

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1400751.1400802

zbMATH Keywords

Byzantine failuresclock synchronizationdigital clock synchronizationdistributed computingfault toleranceself-stabilization

Mathematics Subject Classification ID

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

Recommendations

• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
• Principles of Distributed Systems
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Self-stabilizing Byzantine clock synchronization with optimal precision
• Self-stabilising Byzantine clock synchronisation is almost as easy as consensus

Cited in

(23)

• Perennial secure multi-party computation of universal Turing machine
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
• Dynamic ad hoc clock synchronization
• Preserving stabilization while \textit{practically} bounding state space using incorruptible partially synchronized clocks
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Self-stabilizing Byzantine asynchronous unison
• On self-stabilizing wait-free clock synchronization
• Fault Tolerant Gradient Clock Synchronization
• Self-stabilizing Byzantine agreement
• Efficient counting with optimal resilience
• Principles of Distributed Systems
• Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
• Dynamic FTSS in asynchronous systems: the case of unison
• Booting clock synchronization in partially synchronous systems
• Self-stabilizing Byzantine clock synchronization with optimal precision
• Near-optimal self-stabilising counting and firing squads
• Self-stabilizing Byzantine clock synchronization with optimal precision
• Self-stabilizing indulgent zero-degrading binary consensus
• Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
• Randomization adaptive self-stabilization
• Secure and self-stabilizing clock synchronization in sensor networks
• Synchronous counting and computational algorithm design

This page was built for publication: Fast self-stabilizing Byzantine tolerant digital clock synchronization

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