From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits

@inproceedings{King2009FromAE,
  title={From Almost Everywhere to Everywhere: Byzantine Agreement with {\~O}(n3/2) Bits},
  author={Valerie King and Jared Saia},
  booktitle={DISC},
  year={2009}
}
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information synchronous model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each corrupt processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS