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

DOI10.1007/978-3-031-48624-1_15zbMATH Open1545.94071MaRDI QIDQ6587961

Gilad Stern, Julian Loss

Publication date: 15 August 2024

zbMATH Keywords

synchronyconsensusmixed-faults

Mathematics Subject Classification ID

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

Cites Work

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

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)