Trusted Execution Environments in Byzantine-Tolerant Networks

Bachelor thesis (2021)

Authors

S.L. van Tiggele Electrical Engineering, Mathematics and Computer Science

Contributors

Jérémie Decouchant Data-Intensive Systems - EEMCS (mentor)
K.G. Langendoen Embedded Systems - EEMCS (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2021 Sebastien van Tiggele
More Info
expand_more

Published Date

28-06-2021

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

Achieving consensus in a network is one of the most important performance bottlenecks in distributed computing. This paper takes a look at the existing protocols for achieving Byzantine Reliable Broadcast on asynchronous partially connected networks and how these protocols change to leverage the fact that some nodes have access to Trusted Execution Environments. Modeling some nodes to be completely trusted improves the throughput and reduces latency but the impact changes heavily depending on the placement of these nodes. The second, more realistic approach is having all processes use a local trusted subsystem implemented in a TEE. We show that this reduces the upper bound of faulty nodes from f<N/3 to f<N/2 and reducing the amount of messages sent by up to 64\% (N=30, f=5).