Asynchronous reconfiguration with Byzantine failures

DOI10.1007/s00446-022-00421-1OpenAlexW3032329699MaRDI QIDQ2104034

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

zbMATH Keywords

asynchronous systemreconfigurationByzantine faults

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Permissionless and asynchronous asset transfer

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• 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