Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that can adaptively \emph{corrupt} up to $f

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Huang, Shang-En, Pettie, Seth, Zhu, Leqi
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Computer Science - Distributed, Parallel, and Cluster Computing
Mathematics - Statistics Theory
Statistics - Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that can adaptively \emph{corrupt} up to $f
DOI:10.48550/arxiv.2206.15335