Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus

DOI10.4230/LIPICS.DISC.2020.48MaRDI QIDQ6535048zbMATH OpenFDO

Authors Martin Hirt, Ard Kastrati, Chen-Da Liu-Zhang

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2020.48

zbMATH Keywords

broadcastByzantine agreementmulti-threshold

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computer security (68M25) Distributed algorithms (68W15) Cryptography (94A60)

Recommendations

• Asynchronous consensus and broadcast protocols
• scientific article; zbMATH DE number 2009948
• From partial to global asynchronous reliable broadcast
• Asynchronous byzantine agreement protocols
• scientific article; zbMATH DE number 1848309

Cites work

• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Asynchronous byzantine agreement protocols
• Authenticated Algorithms for Byzantine Agreement
• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• The Byzantine Generals Problem

Cited in

(2)

• From partial to global asynchronous reliable broadcast
• Accountable safety implies finality (short paper)

This page was built for publication: Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus

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