An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience

Ittai Abraham, Danny Dolev, Joseph Y. Halpern. An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience. In Rida A. Bazzi, Boaz Patt-Shamir, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. pages 405-414, ACM, 2008. [doi]

Abstract

Abstract is missing.