Asynchronous reconfiguration with Byzantine failures
From MaRDI portal
Publication:6535026
DOI10.4230/lipics.disc.2020.27zbMath1540.68038MaRDI QIDQ6535026
Petr Kuznetsov, Andrei Tonkikh
Publication date: 2 November 2023
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Elastic configuration maintenance via a parsimonious speculating snapshot solution
- On liveness of dynamic storage
- A forward-secure public-key encryption scheme
- Round-by-round fault detectors (extended abstract)
- Generalized lattice agreement
- Dynamic atomic storage without consensus
- Introduction to Reliable and Secure Distributed Programming
- Impossibility of distributed consensus with one faulty process
- Sharing memory robustly in message-passing systems
- Atomic snapshots using lattice agreement
- Max registers, counters, and monotone circuits
- Dynamic Reconfiguration: A Tutorial (Tutorial)
This page was built for publication: Asynchronous reconfiguration with Byzantine failures
