Approaching Message Optimal Byzantine Reliable Broadcast using Routing

Title

Approaching Message Optimal Byzantine Reliable Broadcast using Routing

 Author

Sluijk, Dany (TU Delft Electrical Engineering, Mathematics and Computer Science)

Contributor

Decouchant, Jérémie (mentor) ORCID 0000-0001-9143-3984
Cox, B.A. (mentor)
Bidarra, Rafael (graduation committee) ORCID 0000-0003-4281-6019

 Degree granting institution

Delft University of Technology

 Programme

Computer Science and Engineering

 Project

CSE3000 Research Project

 Date

2022-06-23

 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.

 Subject

Distributed Systems
Byzantine Reliable Broadcast
Network topology
Signatures
Reliable Communication

 To reference this document use:

http://resolver.tudelft.nl/uuid:dbb3fb22-a6cd-4994-bf1f-7dab42fcc369

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

© 2022 Dany Sluijk
Files
PDF Bachelor_Thesis_6_.pdf 346.8 KB
Close viewer