A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
Thomas Schl\"ogl (TU Wien, Vienna, Austria), Ulrich Schmid (TU Wien,, Vienna, Austria)

TL;DR
This paper establishes sufficient conditions enabling agents in Byzantine fault-tolerant distributed systems to infer correct beliefs from their history, facilitating the development of more efficient and provably correct protocols.
Contribution
It introduces a novel set of conditions and a finite-time procedure for agents to infer beliefs, advancing the design of reliable Byzantine fault-tolerant protocols.
Findings
Conditions enable belief inference from history
Finite-time procedure for checking conditions
Supports development of efficient, correct protocols
Abstract
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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Service-Oriented Architecture and Web Services · Access Control and Trust
