Fast byzantine agreement

Nicolas Braud-Santoni, Rachid Guerraoui, Florian Huc
2013 Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13  
is 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.
doi:10.1145/2484239.2484243 dblp:conf/podc/Braud-SantoniGH13 fatcat:4qmakhm4ofcbdbxams43dabwge