Asynchronous reconfiguration with Byzantine failures
type: Item
instance of: scholarly article
title: Asynchronous reconfiguration with Byzantine failures
author: Petr Kuznetsov
author: Andrei Tonkikh
published in: Distributed Computing
publication date: 2022-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2005.13499
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7630763
zbMATH Keywords: reconfiguration
zbMATH Keywords: asynchronous system
zbMATH Keywords: Byzantine faults
MaRDI profile type: Publication
OpenAlex ID: W3032329699
cites work: Q4904138
cites work: Dynamic atomic storage without consensus
cites work: Q3300828
cites work: Max registers, counters, and monotone circuits
cites work: Sharing memory robustly in message-passing systems
cites work: Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
cites work: Atomic snapshots using lattice agreement
cites work: Q4941872
cites work: Introduction to Reliable and Secure Distributed Programming
cites work: A forward-secure public-key encryption scheme
cites work: Q4709170
cites work: Generalized lattice agreement
cites work: Impossibility of distributed consensus with one faulty process
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: Elastic configuration maintenance via a parsimonious speculating snapshot solution
cites work: \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
cites work: Q5874265
cites work: Q5137358
cites work: Q4737260
cites work: Q4904106
cites work: On liveness of dynamic storage
cites work: Dynamic Reconfiguration: A Tutorial (Tutorial)
cites work: Q5090934
DOI: 10.1007/S00446-022-00421-1
description: scientific article; zbMATH DE number 7630763