Comparative Study of Byzantine Fault Tolerant Consensus Algorithms on Permissioned Blockchains

Student report (2020)

Authors

I. Görkey Electrical Engineering, Mathematics and Computer Science
C. El Moussaoui Electrical Engineering, Mathematics and Computer Science
V.A.E. Wijdeveld Electrical Engineering, Mathematics and Computer Science
E.J. Sennema Electrical Engineering, Mathematics and Computer Science

Contributors

Zekeriya Erkin Electrical Engineering, Mathematics and Computer Science (mentor)
Z. Erkin Electrical Engineering, Mathematics and Computer Science (mentor)
M. Ayşen Electrical Engineering, Mathematics and Computer Science (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2020 Isitan Görkey, Chakir El Moussaoui, Vincent Wijdeveld, Erik Sennema
More Info
expand_more

Published Date

29-04-2020

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

Blockchain is a technology that is in use increasingly. Although owing its common use to the cryptocurrencies there is more to the blockchain technology than just the monetary use. One of these uses is by smaller groups of participants under the control of a central authority, for instance at a company. Such private blockchains use permissioned blockchain consensus algorithms as the participants need the permission of the authority to be able to join the system.
This paper will give an overview of the blockchain technology, investigate permissioned and permissionless blockchain, and focus on permissioned blockchains to analyze it in terms of, e.g. trust models between the nodes, incentives, number of nodes & parties involved, and scalability regarding the number of transactions.