Asynchronous reconfiguration with Byzantine failures
From MaRDI portal
Recommendations
Cites work
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- A forward-secure public-key encryption scheme
- Atomic snapshots using lattice agreement
- Byzantine quorum systems
- Convergent and commutative replicated data types
- Dynamic atomic storage without consensus
- Dynamic reconfiguration: a tutorial
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- Elastic configuration maintenance via a parsimonious speculating snapshot solution
- Generalized lattice agreement
- scientific article; zbMATH DE number 2086721 (Why is no real title available?)
- scientific article; zbMATH DE number 1418310 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Introduction to Reliable and Secure Distributed Programming
- MAX registers, counters, and monotone circuits
- On liveness of dynamic storage
- Reconfiguring replicated atomic storage: a tutorial
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Sharing memory robustly in message-passing systems
- The case for reconfiguration without consensus: comparing algorithms for atomic storage
This page was built for publication: Asynchronous reconfiguration with Byzantine failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535026)