Fast Byzantine Agreement

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 and time complexity. Our algorithm is based on a novel, unbalanced, almost everywhere to everywhere Agreement protocol which is interesting in its own right.


Published in:
Proceedings of the 2013 ACM symposium on Principles of distributed computing, 57-64
Presented at:
2013 ACM symposium on Principles of distributed computing, Montreal, Canada, July 22-24, 2013
Year:
2013
ISBN:
978-1-4503-2065-8
Keywords:
Laboratories:




 Record created 2014-05-28, last modified 2018-06-22

Publisher's version:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)