Asynchronous Byzantine Agreement with optimal resilience

@article{Patra2013AsynchronousBA,
  title={Asynchronous Byzantine Agreement with optimal resilience},
  author={Arpita Patra and Ashish Choudhury and C. Pandu Rangan},
  journal={Distributed Computing},
  year={2013},
  volume={27},
  pages={111-146}
}
We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $$n = 3t+1$$ n = 3 t + 1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting at most $$t$$ t out of the $$n$$ n parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham et al. (PODC 2008), our protocol is significantly more efficient in terms of the… CONTINUE READING
8 Citations
29 References
Similar Papers

Similar Papers

Loading similar papers…