Self-stabilizing byzantine agreement

DOI10.1145/1146381.1146405zbMath1314.68075OpenAlexW1980733743MaRDI QIDQ5177275

Danny Dolev, Ariel Daliot

Publication date: 10 March 2015

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

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

zbMATH Keywords

self-stabilizationByzantine agreementreliable broadcastByzantine faultstransient failurespulse synchronization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (6)

Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip ⋮ Tight bound on mobile Byzantine agreement ⋮ Self-stabilizing Byzantine asynchronous unison ⋮ Near-optimal self-stabilising counting and firing squads ⋮ Self-stabilizing Byzantine clock synchronization with optimal precision ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic

This page was built for publication: Self-stabilizing byzantine agreement