Decreasing message complexity in Byzantine Fault Tolerant communications using Consistent-Broadcast

Bachelor thesis (2022)

Authors

D.A. Prinsze Electrical Engineering, Mathematics and Computer Science

Contributors

Jérémie Decouchant Data-Intensive Systems - EEMCS (mentor)
B.A. Cox Data-Intensive Systems - EEMCS (mentor)
R Biddara (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Daan Prinsze
More Info
expand_more

Published Date

23-06-2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

During this research we have replaced Bracha’s layer in the state-of-the-art Bracha-Dolev protocol to improve the performance by decreasing the message complexity of the protocol running on top of a given network topology so long as the requirements stated by Bracha and Dolev are met. Bracha-Dolev is an algorithm that is used to establish a Byzantine fault tolerant communication in a network but it requires a lot of messages to reach consensus. This improvement has been achieved by utilizing a Byzantine Consistent Broadcast algorithm in place of Bracha’s layer: Authenticated Echo Broadcast in order to reduce the message complexity and reduce the network consumption compared to the original optimized Bracha-Dolev algorithm.
Some of the optimizations applied to optimized Bracha-Dolev have also been applied to this new protocol under the hard assumption that the sender is always reliable. As a result, this new protocol is an optimal choice in such instances where these constraints hold and where multiple faulty nodes are present in the system.

Files

Final_version.pdf
(pdf | 0.753 Mb)