Byzantine-tolerant erasure coding for blockchains
department or school: Applied Science, Faculty of
department or school: Engineering, School of (Okanagan)
data provider: DSpace
degree campus: UBCO
creator: Yazdinejad, Saeid
issued: 2024-10-09T08:08:57Z
issued: 2024
related degree: Master of Applied Science - MASc
degree grantor: University of British Columbia
description: This thesis proposes two novel solutions, Aurora and Phoenix, to address the file downloading problem in distributed networks vulnerable to Byzantine faults—scenarios where network components may fail or behave maliciously. Both solutions employ advanced erasure coding and cryptographic schemes to ensure reliable data transfer and integrity verification. Aurora utilizes Maximum Distance Separable (MDS) codes paired with vector commitments like KZG, optimizing for robust data redundancy and secure verification processes. Phoenix, conversely, leverages rateless codes alongside homomorphic commitments, offering greater flexibility and efficiency in data recovery under varying network conditions. Implemented within the HotStuff protocol—a Byzantine Fault Tolerant (BFT) consensus algorithm—Aurora demonstrates enhanced synchronization efficiencies, significantly reducing the overhead in networks with up to 10% faulty nodes. This work contributes to robust and efficient data dissemination protocols that optimize bandwidth and storage utilization, essential for maintaining integrity and performance in critical network infrastructures.
aggregated CHO: https://circle.library.ubc.ca/rest/handle/2429/89356
note: Byzantine-Tolerant Erasure Coding forBlockchainsbySaeid YazdinejadA THESIS SUBMITTED IN PARTIAL FULFILLMENT OFTHE REQUIREMENTS FOR THE DEGREE OFMASTER OF APPLIED SCIENCEinThe College of Graduate Studies(Electrical Engineering)THE UNIVERSITY OF BRITISH COLUMBIA(Okanagan)October 2024© Saeid Yazdinejad, 2024The following individuals certify that they have read and recommend tothe College of Graduate Studies for acceptance a thesis entitled:Byzantine-Tolerant Erasure Coding for Blockchainssubmitted by Saeid Yazdinejad in partial fulfilment of the requirementsof the degree of Master of Applied ScienceChen Feng, School of EngineeringSupervisorAnas Chaaban, School of EngineeringSupervisory Committee MemberZehua Wang, University of British Columbia - VancouverSupervisory Committee MemberFatemeh Hendijani Fard, Irving K. Barber Faculty of ScienceUniversity ExamineriiAbstractThis thesis proposes two novel solutions, Aurora and Phoenix, to ad-dress the file downloading problem in distributed networks vulnerable toByzantine faults—scenarios where network components may fail or behavemaliciously. Both solutions employ advanced erasure coding and crypto-graphic schemes to ensure reliable data transfer and integrity verification.Aurora utilizes Maximum Distance Separable (MDS) codes paired with vec-tor commitments like KZG, optimizing for robust data redundancy and se-cure verification processes. Phoenix, conversely, leverages rateless codesalongside homomorphic commitments, offering greater flexibility and effi-ciency in data recovery under varying network conditions. Implementedwithin the HotStuff protocol—a Byzantine Fault Tolerant (BFT) consensusalgorithm—Aurora demonstrates enhanced synchronization efficiencies, sig-nificantly reducing the overhead in networks with up to 10% faulty nodes.This work contributes to robust and efficient data dissemination protocolsthat optimize bandwidth and storage utilization, essential for maintainingintegrity and performance in critical netwo…
has type: Thesis/Dissertation
date issued: 2024-11
is shown at: 10.14288/1.0445513
language: eng
degree discipline: Electrical Engineering
provider: Vancouver : University of British Columbia Library
publisher: University of British Columbia
rights: Attribution-NoDerivatives 4.0 International
rights URI: http://creativecommons.org/licenses/by-nd/4.0/
scholar level: Graduate
contributor: Feng, Chen
type: Text
identifier URI: http://hdl.handle.net/2429/89356