Publication:5137358

zbMath1448.68147MaRDI QIDQ5137358

Dahlia Malkhi, Michael K. Reiter

Publication date: 2 December 2020

Full work available at URL: https://link.springer.com/article/10.1007/s004460050050

zbMATH Keywords

fault tolerance; replication; quorum systems; Byzantine failures

Mathematics Subject Classification ID

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Unnamed Item, Secure reliable multicast protocols in a WAN, Synchronous Byzantine quorum systems, Access cost for asynchronous Byzantine quorum systems, Permissionless and asynchronous asset transfer, Implementing set objects in dynamic distributed systems, A protocol for implementing Byzantine storage in churn-prone distributed systems, Wait-free regular storage from Byzantine components, Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register, Byzantine quorum systems with maximum availability., Probabilistic quorum systems, Diffusion without false rumors: On propagating updates in a Byzantine environment., The sum of its parts: analysis of federated Byzantine agreement systems, Asynchronous reconfiguration with Byzantine failures, Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps, Two quantum secret sharing schemes with adversary structure, Byzantine disk paxos: optimal resilience with Byzantine shared memory, Computational aspects of uncertainty profiles and angel-daemon games, Unnamed Item, On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory