Xiangzhe Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xiangzhe Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jingjing Zhang
College of Future Information Technology, Fudan University, Shanghai, China
2 shared publications - Shengyun Liu
Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Bo Wang
Central South University, Shanghai Jiao Tong University, China
1 shared publication - He Dong
Shanghai Jiao Tong University, China
1 shared publication - Lei Fan
Shanghai Jiao Tong University
1 shared publication - Marko Vukolić
Protocol Labs
1 shared publication
Latest Publications
- Open Access
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 265-280
Bandle: Asynchronous State Machine Replication Made Efficient
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 265-280
Open AccessBandle: Asynchronous State Machine Replication Made Efficient
- Open Access
- 27 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 178-191
Bridging the Gap of Timing Assumptions in Byzantine Consensus
Asynchronous Byzantine Fault-Tolerant (BFT) consensus protocols maintain strong consistency across nodes (i.e., ensure safety) and terminate probabilistically (i.e., ensure liveness) despite unbounded network delay. In contrast to protocols under partial synchrony, asynchronous counterparts pay no extra timing assumptions for electing a special role, and thus is more robust to network issues. To formally study this feature, we propose a new classification method for consensus and accordingly categorize relevant work: timing-balanced protocols are those that do not introduce strictly stronger timing-related assumptions for liveness, compared to ones required by safety. We further propose ThemiX, a novel timing-balanced protocol under the hybrid model: either there is no corrupt node, or the number of correct and online nodes constitute a majority. ThemiX tolerates f Byzantine faults with a total of n = 2f + 1 nodes, achieving optimal resilience. If every node is honest or benign, ThemiX is an asynchronous protocol. Otherwise, ThemiX relies on timing assumptions for ensuring safety and probabilistic termination. No leader or any special role is elected. To boost performance, we further integrate two practical mechanisms that respectively allow ThemiX to proceed at the pace of actual network speed and bypass the expensive coin-tossing phase (i.e., randomization). Large-scale experiments on Amazon EC2 platform show that ThemiX achieves up to 86% reduction in latency compared to the consensus component of HoneyBadgerBFT and provides sustainable performance under simulated network faults.
- 27 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 178-191
Open AccessBridging the Gap of Timing Assumptions in Byzantine Consensus
Asynchronous Byzantine Fault-Tolerant (BFT) consensus protocols maintain strong consistency across nodes (i.e., ensure safety) and terminate probabilistically (i.e., ensure liveness) despite unbounded network delay. In contrast to protocols under partial synchrony, asynchronous counterparts pay no extra timing assumptions for electing a special role, and thus is more robust to network issues. To formally study this feature, we propose a new classification method for consensus and accordingly categorize relevant work: timing-balanced protocols are those that do not introduce strictly stronger timing-related assumptions for liveness, compared to ones required by safety. We further propose ThemiX, a novel timing-balanced protocol under the hybrid model: either there is no corrupt node, or the number of correct and online nodes constitute a majority. ThemiX tolerates f Byzantine faults with a total of n = 2f + 1 nodes, achieving optimal resilience. If every node is honest or benign, ThemiX is an asynchronous protocol. Otherwise, ThemiX relies on timing assumptions for ensuring safety and probabilistic termination. No leader or any special role is elected. To boost performance, we further integrate two practical mechanisms that respectively allow ThemiX to proceed at the pace of actual network speed and bypass the expensive coin-tossing phase (i.e., randomization). Large-scale experiments on Amazon EC2 platform show that ThemiX achieves up to 86% reduction in latency compared to the consensus component of HoneyBadgerBFT and provides sustainable performance under simulated network faults.