Byzantine Reliable Broadcast on partially connected networks with signatures

Byzantine Reliable Broadcast on partially connected networks with signatures

Klabér, Rahim (TU Delft Electrical Engineering, Mathematics and Computer Science)

Decouchant, Jérémie (mentor)
Langendoen, K.G. (graduation committee)

Delft University of Technology

Computer Science and Engineering

CSE3000 Research Project

2021-07-01

In this paper, we consider Byzantine reliable broadcast on partially connected networks using signatures. Byzantine reliable broadcast in partially connected and authenticated networks can be achieved by combining two algorithms, Gabriel Bracha's double-echo broadcast protocol and Danny Dolev's reliable communication protocol. Bracha's algorithm allows for Byzantine reliable broadcast in fully connected networks, while Dolev's algorithm can be used to provide reliable communication in networks which are atleast $2f+1$-connected, where $f$ is the number of Byzantine nodes. For Byzantine reliable broadcast in partially connected networks, Bracha's algorithm can be used with Dolev's algorithm providing an abstraction of a fully connected network. We show how signatures can be used to lower the connectivity requirement to $f+1$ and lower the message complexity. We also show how aggregate or multi-signatures can be used to lower bandwidth used by the algorithm. When compared to the state-of-the-art Bracha-Dolev without signatures, our protocol has a message complexity which 20 times lower (N=60,f=6).

Byzantine Reliable Broadcast
Partially connected networks
Distributed systems

http://resolver.tudelft.nl/uuid:c847d0e7-d85c-438e-97e6-ee917bb9f094

Student theses

bachelor thesis

© 2021 Rahim Klabér