{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/116220"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/116220","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Implementation and evaluation of fast authenticated byzantine consensus","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","abstract_has_math":false,"creators":["Isaac, Irene M."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Ren, Ling"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-08","date_published":"2022-08","updated_at":"2026-07-22T22:24:55Z","subjects":["Consensus","PBFT","Good Case Latency","2RS-BFT","Partial Synchrony"],"languages":["en","eng"],"rights":["Copyright 2022 Irene Isaac"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/116220","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Ren, Ling"]},{"key":"dc:creator","label":"Author","values":["Isaac, Irene M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-08","2022-07-15"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Consensus","PBFT","Good Case Latency","2RS-BFT","Partial Synchrony"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2022 Irene Isaac"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/116220"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","The student, Irene Isaac, accepted the attached license on 2022-07-12 at 19:46.","The student, Irene Isaac, submitted this Thesis for approval on 2022-07-12 at 20:18.","This Thesis was approved for publication on 2022-07-15 at 11:45.","DSpace SAF Submission Ingestion Package generated from Vireo submission #18257 on 2022-11-15 at 18:20:46","Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for several decades. Improving the latency of BFT-SMR has gained interest in recent years. In this thesis, we focus on improving the good case latency of BFT-SMR in the partial synchrony model, when an honest leader is in charge and the network is synchronous. Practical Byzantine Fault Tolerance (PBFT) has a good case latency of 3 rounds and a resilience of n ≥ 3f + 1. 2 Round Signature-based BFT (2RS-BFT) is a recent protocol that has a good case latency of 2 rounds and a resilience of n ≥ 5f − 1. For the canonical case of n = 4 and f = 1, 2RS-BFT has the same resilience as PBFT and can commit in 2 rounds. In this thesis, we propose a chained version of PBFT. We implement the steady state of both chained PBFT and 2RS-BFT protocol and show that 2RS-BFT protocol is concretely better than PBFT in terms of good case latency. 2RS-BFT can commit in 62.5% - 63.4% of the time required by PBFT to commit."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Implementation and evaluation of fast authenticated byzantine consensus"]}]}],"canonical_facts":{"dc:contributor":["Ren, Ling"],"dc:creator":["Isaac, Irene M."],"dc:date":["2022-08","2022-07-15"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms","The student, Irene Isaac, accepted the attached license on 2022-07-12 at 19:46.","The student, Irene Isaac, submitted this Thesis for approval on 2022-07-12 at 20:18.","This Thesis was approved for publication on 2022-07-15 at 11:45.","DSpace SAF Submission Ingestion Package generated from Vireo submission #18257 on 2022-11-15 at 18:20:46","Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for several decades. Improving the latency of BFT-SMR has gained interest in recent years. In this thesis, we focus on improving the good case latency of BFT-SMR in the partial synchrony model, when an honest leader is in charge and the network is synchronous. Practical Byzantine Fault Tolerance (PBFT) has a good case latency of 3 rounds and a resilience of n ≥ 3f + 1. 2 Round Signature-based BFT (2RS-BFT) is a recent protocol that has a good case latency of 2 rounds and a resilience of n ≥ 5f − 1. For the canonical case of n = 4 and f = 1, 2RS-BFT has the same resilience as PBFT and can commit in 2 rounds. In this thesis, we propose a chained version of PBFT. We implement the steady state of both chained PBFT and 2RS-BFT protocol and show that 2RS-BFT protocol is concretely better than PBFT in terms of good case latency. 2RS-BFT can commit in 62.5% - 63.4% of the time required by PBFT to commit."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/116220"],"dc:language":["en","eng"],"dc:rights":["Copyright 2022 Irene Isaac"],"dc:subject":["Consensus","PBFT","Good Case Latency","2RS-BFT","Partial Synchrony"],"dc:title":["Implementation and evaluation of fast authenticated byzantine consensus"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:55Z"}