Communication-Optimal Convex Agreement

ePrint Report: Communication-Optimal Convex Agreement

Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer

Byzantine Agreement (BA) allows a set of $n$ parties to agree on a value even when up to $t$ of the parties involved are corrupted.
While previous works have shown that, for $\ell$-bit inputs, BA can be achieved with the optimal communication complexity $\mathcal{O}(\ell n)$ for sufficiently large $\ell$, BA only ensures that honest parties agree on a meaningful output when they hold the same input, rendering the primitive …

can chen communication complexity diana eprint report inputs report roger value