Fast byzantine agreement
N Braud-Santoni, R Guerraoui, F Huc - … of the 2013 ACM symposium on …, 2013 - dl.acm.org
N Braud-Santoni, R Guerraoui, F Huc
Proceedings of the 2013 ACM symposium on Principles of distributed computing, 2013•dl.acm.orgThis 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 Õ (√ n) and
time complexity Õ (1). Our algorithm is based on a novel, unbalanced, almost-everywhere to
everywhere Agreement protocol which is interesting in its own right.
communication and time complexities are poly-logarithmic. So far, the most effective
probabilistic Byzantine Agreement algorithm had communication complexity Õ (√ n) and
time complexity Õ (1). Our algorithm is based on a novel, unbalanced, almost-everywhere to
everywhere Agreement protocol which is interesting in its own right.
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 Õ(√n) and time complexity Õ(1).
Our algorithm is based on a novel, unbalanced, almost-everywhere to everywhere Agreement protocol which is interesting in its own right.
ACM Digital Library