Using Weighted Voting to Accelerate Blockchain Consensus

Intrusion tolerance during performance degradation attacks

Bachelor thesis (2024)

Authors

A. Brodovič Electrical Engineering, Mathematics and Computer Science

Contributors

Jérémie Decouchant Data-Intensive Systems - EEMCS (mentor)
R.M. Chotkan Data-Intensive Systems - EEMCS (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
More Info
expand_more

Published Date

26-06-2024

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

This paper examines the impact of faulty nodes on Practical Byzantine Fault Tolerance (PBFT) algorithms, focusing on the AWARE optimization. While AWARE improves average-case latency by assigning larger voting weights to well-connected nodes, it is vulnerable to exploitation by Byzantine nodes. We propose modifications to AWARE to enhance resilience of dynamic link latency estimation. Experiments show that comparing predicted and actual consensus latencies helps detect and mitigate performance issues caused by malicious nodes. Integrating latency information with BFT-SMaRt’s leader change algorithm offers a more robust solution. We also analyse shortcomings of AWARE dynamic leader selection system.

Files

Final.pdf
(pdf | 0.842 Mb)