MiniCast: minimizing the communication complexity of reliable broadcast

DOI10.1007/978-3-031-91092-0_4MaRDI QIDQ6891261zbMATH OpenFDO

Authors Thomas Locher, Victor Shoup

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91092-0_4

zbMATH Keywords

communication complexityreliable broadcast protocol

Mathematics Subject Classification ID

Communication theory (94A05)

Cites work

• Asynchronous byzantine agreement protocols
• Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation
• Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
• scientific article; zbMATH DE number 1848309 (Why is no real title available?)
• Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
• Polynomial Codes Over Certain Finite Fields

This page was built for publication: MiniCast: minimizing the communication complexity of reliable broadcast

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