Tomás Maria de Aquino da Silva de Araújo Pereira

Co-advisor: M. Matos


Dynamic Trees for Byzantine Consensus Protocols


Tese submetida para provas de mestrado em Engenharia Informática e de Computadores Instituto Superior Técnico, Universidade de Lisboa.

Abstract

The use of dissemination and aggregation trees allows Byzantine Fault Tolerance (BFT) consensus protocols to increase both their efficiency and scalability, which are key requirements in blockchain ap- plications. The dynamic reconfiguration of a dissemination tree can be a complex task. As a result, most protocols that use dissemination and aggregation trees avoid frequent reconfigurations by using a stable leader policy. Unfortunately, the use of a stable leader is undesirable in blockchain applications, due to equity and censorship concerns. In this work, we propose efficient techniques to support leader rotation and dynamic reconfiguration of dissemination and aggregation trees in BFT consensus protocols. We have applied our techniques to Kauri, a state-of-the-art tree-based consensus BFT algorithm. Through the experimental evaluation, conducted on a real implementation of our solution, we analyse the perfor- mance of our proposed mechanisms and show that dynamic reconfiguration can be supported without incurring a significant penalty on the throughput of the system.

Publicações

Dynamic Trees for Byzantine Consensus Protocols
Tomás Maria de Aquino da Silva de Araújo Pereira
MSc Thesis. Instituto Superior Técnico, Universidade de Lisboa.
November 2024.
Available BibTeX, MSC Thesis, and extended abstract, and mid-term report.
Reconfiguração Dinâmica de Protocolos Tolerantes a Faltas Bizantinas Baseados em Árvores.
T. Pereira, M. Matos and L. Rodrigues.
Actas do décimo quinto Simpósio de Informática (Inforum), Lisboa, Portugal, Sep. 2024.
Available BibTeX, extended report (pdf).

Luís Rodrigues