A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems

04/01/2023
by   Thomas Schlögl, et al.
0

Existing protocols for byzantine fault tolerant distributed systems usually rely on the correct agents' ability to detect faulty agents and/or to detect the occurrence of some event or action occurring on some correct agent. In this paper, we provide sufficient conditions that allow an agent to infer the appropriate beliefs from its history, and a procedure that allows these conditions to be checked in finite time. Our results thus provide essential stepping stones for developing efficient protocols and proving them correct.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2019

Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems

Causality is an important concept both for proving impossibility results...
research
08/05/2019

The fault-tolerant cluster-sending problem

The development of fault-tolerant distributed systems that can tolerate ...
research
03/20/2019

Byzantine Fault Tolerant Distributed Linear Regression

This paper considers the problem of Byzantine fault tolerant distributed...
research
07/31/2022

Learning to generate Reliable Broadcast Algorithms

Modern distributed systems are supported by fault-tolerant algorithms, l...
research
10/14/2020

BFT Protocol Forensics

Byzantine fault-tolerant (BFT) protocols allow a group of replicas to co...
research
03/07/2022

Simulating Authenticated Broadcast in Networks of Bounded Degree

The authenticated broadcast is simulated in the bounded-degree networks ...
research
11/02/2020

The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks

Recently, a detailed epistemic reasoning framework for multi-agent syste...

Please sign up or login with your details

Forgot password? Click here to reset