Synchronous Byzantine quorum systems

DOI10.1007/s004460050004zbMath1448.68070OpenAlexW2007792412MaRDI QIDQ5137894

Rida A. Bazzi

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050004

zbMATH Keywords

distributed systemsfault tolerancequorumsloadsByzantine failures

Mathematics Subject Classification ID

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

Related Items (5)

Byzantine disk paxos: optimal resilience with Byzantine shared memory ⋮ A protocol for implementing Byzantine storage in churn-prone distributed systems ⋮ Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps

Cites Work

• Unnamed Item
• Unnamed Item
• On interprocess communication. II: Algorithms
• Distributed match-making
• The availability of quorum systems
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• How to assign votes in a distributed system
• The Load, Capacity, and Availability of Quorum Systems
• Crumbling walls
• The load and availability of Byzantine quorum systems
• Synchronous Byzantine quorum systems

This page was built for publication: Synchronous Byzantine quorum systems