Approaching Message Optimal Byzantine Reliable Broadcast using Routing

Bachelor thesis (2022)

Authors

D. Sluijk Electrical Engineering, Mathematics and Computer Science

Contributors

Jérémie Decouchant Data-Intensive Systems - EEMCS (mentor)
B.A. Cox Data-Intensive Systems - EEMCS (mentor)
Rafael Bidarra Computer Graphics and Visualisation - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Dany Sluijk
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

In this paper we will consider the Byzantine Reliable Broadcast problem on partially connected net- works. We introduce an routing algorithm for networks with a known topology. It will show that when this is combined with cryptographic signatures, we can use the routing algorithm to create an optimal amount of messages. We will introduce a few algorithms to estimate the routes required for this algorithm. Our simulations show that the amount of messages required for Byzantine Reliable Broadcast can be massively decreased by using this. We will also show that the method of choosing these paths has a huge impact, but come with their own trade- offs.