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.


Publié dans:
Proceedings of the 2013 ACM symposium on Principles of distributed computing, 57-64
Présenté à:
2013 ACM symposium on Principles of distributed computing, Montreal, Canada, July 22-24, 2013
Année
2013
ISBN:
978-1-4503-2065-8
Mots-clefs:
Laboratoires:




 Notice créée le 2014-05-28, modifiée le 2019-12-05

Publisher's version:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)