Shengyun Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shengyun Liu has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Bo Wang
Central South University, Shanghai Jiao Tong University, China
2 shared publications - Jingjing Zhang
College of Future Information Technology, Fudan University, Shanghai, China
2 shared publications - Lei Fan
Shanghai Jiao Tong University
2 shared publications - Wenbo Xu
AntChain Platform Division, Ant Group China
2 shared publications - Xiangzhe Wang
Shanghai Jiao Tong University, China
2 shared publications - Yiming Zhang
Shanghai Jiao Tong University, Shanghai, China
2 shared publications
Latest Publications
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5547-5556
BIND: Enabling Continuous Transaction Processing During Account Migration in Sharded Blockchains
Account migration in sharded blockchains presents a critical trade-off between optimization effectiveness and system availability. While dynamically reallocating accounts across shards can significantly reduce cross-shard transaction overhead, existing migration mechanisms cause service disruptions that intensify as state data volumes grow. To address this challenge, we propose BIND, a batch-wise account migration protocol that eliminates service interruptions by enabling continuous transaction processing throughout migration. BIND introduces a dual transaction pool architecture that isolates transactions involving migrating accounts while allowing non-migrating accounts to operate uninterrupted. To optimize migration efficiency, we design a reverse greedy heuristic algorithm that partitions accounts into batches based on community cohesion, maximizing intra-batch connectivity to front-load cross-shard communication reduction. We evaluate BIND using real Ethereum transactions, demonstrating superior performance over existing mechanisms. BIND achieves 12% higher overall throughput, reduces migration time to 23.6%-39.3% of the one-shot baseline (across 1-10Gbps bandwidth), and lowers cross-shard transaction rates by 24.1% compared to random batching. These results confirm BIND as a practical solution for large-scale, non-disruptive account migration in production sharded blockchains.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5547-5556
Open AccessBIND: Enabling Continuous Transaction Processing During Account Migration in Sharded Blockchains
Account migration in sharded blockchains presents a critical trade-off between optimization effectiveness and system availability. While dynamically reallocating accounts across shards can significantly reduce cross-shard transaction overhead, existing migration mechanisms cause service disruptions that intensify as state data volumes grow. To address this challenge, we propose BIND, a batch-wise account migration protocol that eliminates service interruptions by enabling continuous transaction processing throughout migration. BIND introduces a dual transaction pool architecture that isolates transactions involving migrating accounts while allowing non-migrating accounts to operate uninterrupted. To optimize migration efficiency, we design a reverse greedy heuristic algorithm that partitions accounts into batches based on community cohesion, maximizing intra-batch connectivity to front-load cross-shard communication reduction. We evaluate BIND using real Ethereum transactions, demonstrating superior performance over existing mechanisms. BIND achieves 12% higher overall throughput, reduces migration time to 23.6%-39.3% of the one-shot baseline (across 1-10Gbps bandwidth), and lowers cross-shard transaction rates by 24.1% compared to random batching. These results confirm BIND as a practical solution for large-scale, non-disruptive account migration in production sharded blockchains.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6293-6310
Customizable Information Dispersal-Based Byzantine Broadcast With Communication Optimization Using Bloom Filters
Byzantine Fault-tolerant State Machine Replication (BFT SMR) is essential for ensuring the security of high-level services such as blockchain, particularly in scenarios where a subset of nodes may exhibit arbitrary faults. As Byzantine Fault-tolerant broadcast in asynchronous networks is a core component of BFT SMR, this paper studies this broadcast primitive. We propose a novel broadcast protocol in which nodes encode large messages $M$ using erasure codes, aggregate the encoded codewords into a vector via a Bloom filter, and employ error correction codes to encode the vector. This approach achieves the known lower bound on the communication complexity of $O(|M|n+\kappa n^{2})$, where $\kappa$ represents the output size of a collision-resistant hash function and $n$ is the total number of nodes. Performance tests in the Amazon cloud environment demonstrate that when nodes broadcast large messages ($|M|\gg \kappa n^{2}$), the throughput of the new protocol is twice that of existing solutions. Furthermore, the Bloom filter enables the broadcast protocol to possess customizable features for the first time, allowing developers to reduce communication costs through parameter tuning.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (3) , 6293-6310
Customizable Information Dispersal-Based Byzantine Broadcast With Communication Optimization Using Bloom Filters
Byzantine Fault-tolerant State Machine Replication (BFT SMR) is essential for ensuring the security of high-level services such as blockchain, particularly in scenarios where a subset of nodes may exhibit arbitrary faults. As Byzantine Fault-tolerant broadcast in asynchronous networks is a core component of BFT SMR, this paper studies this broadcast primitive. We propose a novel broadcast protocol in which nodes encode large messages $M$ using erasure codes, aggregate the encoded codewords into a vector via a Bloom filter, and employ error correction codes to encode the vector. This approach achieves the known lower bound on the communication complexity of $O(|M|n+\kappa n^{2})$, where $\kappa$ represents the output size of a collision-resistant hash function and $n$ is the total number of nodes. Performance tests in the Amazon cloud environment demonstrate that when nodes broadcast large messages ($|M|\gg \kappa n^{2}$), the throughput of the new protocol is twice that of existing solutions. Furthermore, the Bloom filter enables the broadcast protocol to possess customizable features for the first time, allowing developers to reduce communication costs through parameter tuning.
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1126-1141
Cheetah: Metadata Aggregation for Fast Object Storage without Distributed Ordering
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1126-1141
Open AccessCheetah: Metadata Aggregation for Fast Object Storage without Distributed Ordering
- 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.
- Open Access
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 264-280
Flexible Advancement in Asynchronous BFT Consensus
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 264-280
Open AccessFlexible Advancement in Asynchronous BFT Consensus