Computer Science/Discrete Mathematics Seminar II
Byzantine Broadcast in $\tilde{O}(n^2)$ Communication
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.
Joint work with Jovan Komatovic and Ling Ren. This result was found via extensive discussion and collaboration with ChatGPT dot.
Date & Time
November 24, 2026 | 10:30am – 12:30pm
Add to calendar
11/24/2026 10:30
11/24/2026 12:30
Computer Science/Discrete Mathematics Seminar II
use-title
Topic: Byzantine Broadcast in $\tilde{O}(n^2)$ Communication
Speakers: Yuval Efron, Institute for Advanced Study
More: https://www.ias.edu/math/events/computer-sciencediscrete-mathematics-seminar-ii-632
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.
Joint work with Jovan Komatovic and Ling Ren. This result was found
via extensive discussion and collaboration with ChatGPT dot.
Simonyi 101 and Remote Access
a7a99c3d46944b65a08073518d638c23
Location
Simonyi 101 and Remote AccessSpeakers
Yuval Efron, Institute for Advanced Study