A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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