A protocol for implementing Byzantine storage in churn-prone distributed systems

DOI10.1016/J.TCS.2013.04.005zbMath1358.68036OpenAlexW2029672793MaRDI QIDQ391995

Roberto Baldoni, Amir Soltani Nezhad, Silvia Bonomi

Publication date: 13 January 2014

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

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

zbMATH Keywords

churnByzantine fault tolerancedynamic distributed systemseventually synchronous distributed systemsafe register

Mathematics Subject Classification ID

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

Related Items (1)

A protocol for implementing Byzantine storage in churn-prone distributed systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A protocol for implementing Byzantine storage in churn-prone distributed systems
• Reconfigurable distributed storage for dynamic networks
• Synchronous Byzantine quorum systems
• Dynamic atomic storage without consensus
• Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

This page was built for publication: A protocol for implementing Byzantine storage in churn-prone distributed systems