Asynchronous reconfiguration with Byzantine failures
From MaRDI portal
Publication:2104034
DOI10.1007/S00446-022-00421-1OpenAlexW3032329699MaRDI QIDQ2104034FDOQ2104034
Authors: Petr Kuznetsov, Andrei Tonkikh 
Publication date: 9 December 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.13499
Recommendations
Cites Work
- Dynamic atomic storage without consensus
- Title not available (Why is that?)
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots using lattice agreement
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Introduction to Reliable and Secure Distributed Programming
- Title not available (Why is that?)
- Sharing memory robustly in message-passing systems
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- A forward-secure public-key encryption scheme
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
- Elastic configuration maintenance via a parsimonious speculating snapshot solution
- On liveness of dynamic storage
- Generalized lattice agreement
- Title not available (Why is that?)
- Max registers, counters, and monotone circuits
- Dynamic Reconfiguration: A Tutorial (Tutorial)
- Title not available (Why is that?)
Cited In (4)
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 Q2104034)
