Publications: Abstract

 In the standard model with only pairwise communication channels, unconditionally secure broadcast among $n$ players is achievable if and only if the number $t$ of corrupted players satisfies $t<\frac{n}{3}$. We show that, when additionally given broadcast among each subset of three players then global broadcast is achievable if $t<\frac{n}{2}$.