Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults

DOI10.1007/978-3-031-48624-1_15MaRDI QIDQ6587961zbMATH OpenFDO

Authors Julian Loss, Gilad Stern

Publication date 15 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48624-1_15

zbMATH Keywords

consensusmixed-faultssynchrony

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Message-optimal protocols for Byzantine Agreement
• Byzantine agreement in the full-information model in O( n) rounds
• Authenticated Byzantine generals in dual failure model
• Sublinear-round Byzantine agreement under corrupt majority
• Efficient Byzantine Agreement with Faulty Minority

Cites work

• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• Authenticated Algorithms for Byzantine Agreement
• Distributed agreement in the presence of processor and communication faults
• Efficient Byzantine Fault-Tolerance
• HotStuff
• How Byzantine is a send corruption?
• On Expected Constant-Round Protocols for Byzantine Agreement
• Realistic Failures in Secure Multi-party Computation
• Synchronous consensus with optimal asynchronous fallback guarantees
• The Byzantine Generals Problem

Cited in

(3)

• Consensus in the presence of overlapping faults and total omission
• General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
• Optimal Byzantine agreement in the presence of message drops

This page was built for publication: Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587961)