{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/115413"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/115413","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Efficient and resilient consensus for permissioned blockchain","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms","abstract_has_math":false,"creators":["Xiang, Zhuolun"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Ren, Ling","Gupta, Indranil","Vaidya, Nitin H.","Viswanath, Pramod","Shi, Elaine"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-05","date_published":"2022-05","updated_at":"2026-07-22T22:24:54Z","subjects":["consensus","Byzantine fault","blockchain"],"languages":["en","eng"],"rights":["Copyright 2022 Zhuolun Xiang"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/115413","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Ren, Ling","Gupta, Indranil","Vaidya, Nitin H.","Viswanath, Pramod","Shi, Elaine"]},{"key":"dc:creator","label":"Author","values":["Xiang, Zhuolun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-05","2022-04-21"]},{"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":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"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","Byzantine fault","blockchain"]}]},{"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 Zhuolun Xiang"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/115413"]}]},{"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-11 without embargo terms","The student, Zhuolun Xiang, accepted the attached license on 2022-04-20 at 16:51.","The student, Zhuolun Xiang, submitted this Dissertation for approval on 2022-04-20 at 17:13.","This Dissertation was approved for publication on 2022-04-21 at 12:45.","DSpace SAF Submission Ingestion Package generated from Vireo submission #17862 on 2022-11-11 at 13:42:36","Reaching consensus among different participants in a distributed system is a fundamental problem that has been studied extensively in the past decades. Due to the recent popularity of digital currency and the need to build high-performance decentralized financial infrastructures, the classic consensus problem attracts renewed attention. This thesis investigates consensus in the permissioned setting where the participants know each other's identities. In contrast to permissionless consensus protocols like Nakamoto consensus that relies on expensive proof-of-work or other mechanisms against Sybil attacks, permissioned consensus can offer better performance without high energy consumption, thus suitable for applications like permissioned blockchain. While decades of research on permissioned consensus already developed numerous protocols and impossibility results, many challenges and open problems still arise to build an efficient and robust permissioned blockchain. In this thesis, I will first present several theoretical results on the communication complexity and latency that fundamentally improve the state-of-the-art, and then present several practical consensus protocols that can enhance the robustness of existing permissioned blockchain systems. More specifically, I will first propose extension protocols for Byzantine agreement and broadcast with improved communication complexity, where the extension protocol can solve the problem with long inputs using single-bit instances. Then, I will show results for the good-case latency of Byzantine broadcast, which measures the commit latency under a non-faulty broadcaster. A complete categorization of the tight bounds of the good-case latency will be presented for both authenticated and unauthenticated settings with various network models. Next, I will describe the notion of strengthened fault tolerance which can enhance the fault tolerance of chain-based BFT from one-third up to two-thirds during the optimistic period. Finally, I will propose an asynchronous fallback protocol that can replace the view-change of partially synchronous BFT protocols like HotStuff, to obtain a network-adaptive consensus protocol with optimal communication cost on and off the happy path, and makes progress even under asynchrony."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Efficient and resilient consensus for permissioned blockchain"]}]}],"canonical_facts":{"dc:contributor":["Ren, Ling","Gupta, Indranil","Vaidya, Nitin H.","Viswanath, Pramod","Shi, Elaine"],"dc:creator":["Xiang, Zhuolun"],"dc:date":["2022-05","2022-04-21"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms","The student, Zhuolun Xiang, accepted the attached license on 2022-04-20 at 16:51.","The student, Zhuolun Xiang, submitted this Dissertation for approval on 2022-04-20 at 17:13.","This Dissertation was approved for publication on 2022-04-21 at 12:45.","DSpace SAF Submission Ingestion Package generated from Vireo submission #17862 on 2022-11-11 at 13:42:36","Reaching consensus among different participants in a distributed system is a fundamental problem that has been studied extensively in the past decades. Due to the recent popularity of digital currency and the need to build high-performance decentralized financial infrastructures, the classic consensus problem attracts renewed attention. This thesis investigates consensus in the permissioned setting where the participants know each other's identities. In contrast to permissionless consensus protocols like Nakamoto consensus that relies on expensive proof-of-work or other mechanisms against Sybil attacks, permissioned consensus can offer better performance without high energy consumption, thus suitable for applications like permissioned blockchain. While decades of research on permissioned consensus already developed numerous protocols and impossibility results, many challenges and open problems still arise to build an efficient and robust permissioned blockchain. In this thesis, I will first present several theoretical results on the communication complexity and latency that fundamentally improve the state-of-the-art, and then present several practical consensus protocols that can enhance the robustness of existing permissioned blockchain systems. More specifically, I will first propose extension protocols for Byzantine agreement and broadcast with improved communication complexity, where the extension protocol can solve the problem with long inputs using single-bit instances. Then, I will show results for the good-case latency of Byzantine broadcast, which measures the commit latency under a non-faulty broadcaster. A complete categorization of the tight bounds of the good-case latency will be presented for both authenticated and unauthenticated settings with various network models. Next, I will describe the notion of strengthened fault tolerance which can enhance the fault tolerance of chain-based BFT from one-third up to two-thirds during the optimistic period. Finally, I will propose an asynchronous fallback protocol that can replace the view-change of partially synchronous BFT protocols like HotStuff, to obtain a network-adaptive consensus protocol with optimal communication cost on and off the happy path, and makes progress even under asynchrony."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/115413"],"dc:language":["en","eng"],"dc:rights":["Copyright 2022 Zhuolun Xiang"],"dc:subject":["consensus","Byzantine fault","blockchain"],"dc:title":["Efficient and resilient consensus for permissioned blockchain"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:54Z"}