Improvement and partial simulation of King & Saia’s expected-polynomial-time Byzantine agreement algorithm

Simple item page
dc.contributor.authorKimmett, Ben
dc.contributor.supervisorCoady, Yvonne
dc.contributor.supervisorKing, Valerie D.
dc.date.accessioned2020-06-16T21:24:55Z
dc.date.available2020-06-16T21:24:55Z
dc.date.copyright2020en_US
dc.date.issued2020-06-16
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en_US
dc.description.abstractWe present a partial implementation of King and Saia 2016’s expected polyno- mial time byzantine agreement algorithm, which which greatly speeds up Bracha’s Byzantine agreement algorithm by introducing a shared coin flip subroutine and a method for detecting adversarially controlled nodes. In addition to implementing the King-Saia algorithm, we detail a new version of the “blackboard” abstraction used to implement the shared coin flip, which improves the subroutine’s resilience from t < n/4 to t < n/3 and leads to an improvement of the resilience of the King-Saia Byzantine agreement algorithm overall. We test the King-Saia algorithm, and detail a series of adversarial attacks against it; we also create a Monte Carlo simulation to further test one particular attack’s level of success at biasing the shared coin flipen_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/11836
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectbyzantine agreementen_US
dc.subjectinteractive consistencyen_US
dc.subjectBrachaen_US
dc.subjectx-syncen_US
dc.subjectshared coin flipen_US
dc.subjectdecisionen_US
dc.subjectadversaryen_US
dc.subjectasynchronousen_US
dc.subjectreliable broadcasten_US
dc.subjectvalidationen_US
dc.subjectblackboarden_US
dc.subjectMonte Carlo simulationen_US
dc.subjectpolynomial timeen_US
dc.subjectKing-Saiaen_US
dc.subjectKingen_US
dc.subjectSaiaen_US
dc.subjectresilienceen_US
dc.subjectimproved resilienceen_US
dc.subjectGlobal-Coinen_US
dc.titleImprovement and partial simulation of King & Saia’s expected-polynomial-time Byzantine agreement algorithmen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kimmett_Ben_MSc_2020.pdf
Size:
395.59 KB
Format:
Adobe Portable Document Format
Description:
Thesis
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.