- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Byzantine-tolerant erasure coding for blockchains
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Byzantine-tolerant erasure coding for blockchains Yazdinejad, Saeid
Abstract
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.
Item Metadata
Title |
Byzantine-tolerant erasure coding for blockchains
|
Creator | |
Supervisor | |
Publisher |
University of British Columbia
|
Date Issued |
2024
|
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.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2024-10-09
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0445513
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2024-11
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NoDerivatives 4.0 International