Broadcast Extensions with Optimal Communication and Round Complexity
Chaya Ganesh, Arpita Patra · 2016
The problem of broadcast and Byzantine Agreement are of interest to both distributed computing and cryptography community. Often these primitives require prohibitive communication and round complexity. Broadcast extensions have been introduced to broadcast long messages at the cost of small number of broadcasts for bit. The latter are referred to as seed broadcasts.