scientific article; zbMATH DE number 7280021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fault tolerancereplicationquorum systemsByzantine failures

Mathematics Subject Classification ID

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

Related Items (20)

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

This page was built for publication: