Fault-Tolerant Distributed Computing in Full-Information Networks

@article{Goldwasser2006FaultTolerantDC,
  title={Fault-Tolerant Distributed Computing in Full-Information Networks},
  author={Shafi Goldwasser and Elan Pavlov and Vinod Vaikuntanathan},
  journal={2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
  year={2006},
  pages={15-26}
}
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: An O(log n)-round randomized Byzantine agreement (BA) protocol in a synchronous full-information network tolerating t < n/(3+epsi) faulty players (for any constant epsi > 0). As such, our protocol is asymptotically optimal in terms of fault-tolerance. An O(1)-round randomized BA protocol in a synchronous full-information network… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS