Fast Byzantine Agreement

Nicolas Braud-Santoni, Rachid Guerraoui, Florian Huc

Abstract: This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity O*(sqrt n), and time complexity O*(1). Our algorithm is based on a novel, unbalanced, almost everywhere to everywhere Agreement protocol which is interesting in its own right.

Guest: Florian Huc
Host: Stefan Schmid

Leave a Reply

Your email address will not be published.

163,962 Spam Comments Blocked so far by Spam Free Wordpress

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>