Byzantine Broadcast in $\widetilde{O}(n^2)$ Communication

Yuval Efron; Jovan Komatovic; Ling ren

Paper 2026/2504

Byzantine Broadcast in $\widetilde{O}(n^2)$ Communication

Yuval Efron

, IAS

Jovan Komatovic

, Category Labs

Ling ren

, University of Illinois Urbana-Champaign

Abstract

We present a deterministic $n$-party Byzantine broadcast protocol secure against $t<n$ faults, with communication complexity $O(n^2\log^4(n)\lambda)$ and $O(t)$ rounds (where $\lambda$ is a security parameter), improving upon the seminal Dolev--Strong protocol from 1983.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Broadcast Consensus
Contact author(s): efronyuv @ ias edu
jkomatovic @ category xyz
renling @ illinois edu
History: 2026-10-17: approved; 2026-10-16: received; See all versions
Short URL: https://ia.cr/2026/2504
License: CC BY

BibTeX

@misc{cryptoeprint:2026/2504,
      author = {Yuval Efron and Jovan Komatovic and Ling ren},
      title = {Byzantine Broadcast in $\widetilde{O}(n^2)$ Communication},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2504},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2504}
}