Probabilistic Byzantine fault tolerance

DOI10.1145/3662158.3662810MaRDI QIDQ6971960zbMATH OpenFDO

Authors Diogo Avelas, Hasan Heydari, Eduardo Alchieri, Tobias Distler, Alysson Neves Bessani

Publication date 13 June 2025

Full work available at URL https://doi.org/10.1145/3662158.3662810

zbMATH Keywords

Byzantine fault-toleranceByzantine quorum systemsconsensusprobabilistic protocols

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites work

• All You Need is DAG
• Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
• Concentration of Measure for the Analysis of Randomized Algorithms
• Distributed Computing
• Expected linear round synchronization: the missing link for linear Byzantine SMR
• Good-case Latency of Byzantine Broadcast
• HotStuff
• scientific article; zbMATH DE number 5823844 (Why is no real title available?)
• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Making Byzantine consensus live
• Probabilistic quorum systems
• Random oracles in constantipole
• Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
• Signed quorum systems
• The Byzantine Generals Problem
• The sleepy model of consensus

This page was built for publication: Probabilistic Byzantine fault tolerance

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