Õptimal Parallel Broadcast

ePrint Report: Õptimal Parallel Broadcast

Gilad Asharov, Anirudh Chandramouli

We study broadcast protocols in the information-theoretic model under optimal conditions, where the number of corruptions $t$ is at most one-third of the parties, $n$. While worst-case $\Omega(n)$ round broadcast protocols are known to be impossible to achieve, protocols with an expected constant number of rounds have been demonstrated since the seminal work of Feldman and Micali [STOC'88]. Communication complexity for such protocols has gradually improved over the years, reaching $O(nL)$ …

broadcast case conditions eprint report information omega parallel protocols report study third under