Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps

DOI10.1016/J.TCS.2022.11.028OpenAlexW4309940993MaRDI QIDQ2110369

Silvia Bonomi, Sébastien Tixeuil, Antonella Del Pozzo, Maria Gradinariu Potop-Butucaru

Publication date: 21 December 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.02694

zbMATH Keywords

self stabilizationshared registerbounded timestampsmobile Byzantine failure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum metric spanning tree made Byzantine tolerant
• Tight bound on mobile Byzantine agreement
• On interprocess communication. I: Basic formalism
• Stabilization and pseudo-stabilization
• Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
• Practically stabilizing SWMR atomic memory in message-passing systems
• Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
• The Impact of Topology on Byzantine Containment in Stabilization
• A new solution for the Byzantine generals problem
• Self-stabilizing systems in spite of distributed control
• Sharing memory robustly in message-passing systems
• Synchronous Byzantine quorum systems
• How to withstand mobile virus attacks (extended abstract)
• Self-stabilization of Byzantine Protocols
• Optimal Mobile Byzantine Fault Tolerant Distributed Storage
• Principles of Distributed Systems

This page was built for publication: Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps