Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register

DOI10.1016/J.TCS.2017.08.020zbMath1382.68029OpenAlexW2754052230MaRDI QIDQ1686114

Antonella Del Pozzo, Silvia Bonomi, Maria Gradinariu Potop-Butucaru

Publication date: 20 December 2017

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.020

zbMATH Keywords

Byzantine mobile agentsround-based synchronous computationself-stabilizing atomic storage

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On interprocess communication. I: Basic formalism
• Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
• A new solution for the Byzantine generals problem
• Synchronous Byzantine quorum systems
• How to withstand mobile virus attacks (extended abstract)
• Optimal Mobile Byzantine Fault Tolerant Distributed Storage

This page was built for publication: Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register