Asynchronous reconfiguration with Byzantine failures

DOI10.1007/S00446-022-00421-1MaRDI QIDQ2104034zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asynchronous systemreconfigurationByzantine faults

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7650881
• Dynamic reconfiguration: abstraction and optimal asynchronous solution
• Distributed Computing
• Synchronous Byzantine quorum systems
• Reconfigurable distributed storage for dynamic networks

Cites work

• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• scientific article; zbMATH DE number 2086721 (Why is no real title available?)
• scientific article; zbMATH DE number 1418310 (Why is no real title available?)
• scientific article; zbMATH DE number 7650881 (Why is no real title available?)
• 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
• Impossibility of distributed consensus with one faulty process
• Introduction to Reliable and Secure Distributed Programming
• Lattice agreement in message passing systems
• 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
• Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
• \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks

Cited in

(7)

• Moving participants turtle consensus
• Dynamic reconfiguration: abstraction and optimal asynchronous solution
• scientific article; zbMATH DE number 7650881 (Why is no real title available?)
• Non-determinism in Byzantine fault-tolerant replication
• Permissionless and asynchronous asset transfer
• scientific article; zbMATH DE number 1950673 (Why is no real title available?)
• Asynchronous reconfiguration with Byzantine failures

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)