Realizing Corrupted-Shard Tolerance: A Sharding Blockchain with Preserving Global Resilience
Yizhong Liu, Andi Liu, Zhuocheng Pan, Yuxuan Hu, Jianwei Liu, Song Bian, Yuan Lu, Zhenyu Guan, Dawei Li, Meikang Qiu
Abstract
Blockchain sharding is a promising approach to enhancing scalability by partitioning the network into smaller, parallel shards. However, existing sharding blockchains that rely on Byzantine fault tolerance protocols require large shard sizes to meet strict security thresholds, limiting scalability, while relaxing security parameters can lead to liveness and safety violations. In this work, we present Camael, a secure sharding blockchain that achieves corrupted-shard tolerance through effective detection and processing mechanisms for both liveness and safety violations. Specifically, fake liveness violations forged by malicious nodes are accurately detected via a two-phase reporting and confirmation mechanism, while concealed safety violations are efficiently identified using a lightweight snapshot mechanism. Furthermore, a state determination process ensures overall system consistency. Malicious nodes are precisely identified through a conviction mechanism, which enables the replacement of the targeted nodes and the reconfiguration of the shards. Notably, Camael ensures security while preserving a global fault tolerance of 1/3 and tolerating corrupted shards, with each shard accommodating up to 2/3 malicious nodes. Extensive experiments conducted on 2000 AWS EC2 nodes across 4 regions demonstrate that Camael improves throughput by 3.56 times compared to the baseline (Kronos, NDSS'25), achieving a throughput of 109.3 ktx/sec, while the violation processing requires only 1.64 sec.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers2
- Hydra: Breaking the Global Ordering Barrier in Multi-BFT ConsensusHanzheng Lyu, Shaokang Xie, Jianyu Niu, Mohammad Sadoghi et al.ICDE 2026
- Logos: Robust Sharding Blockchain With Fast Processing and Optimal Cross-Shard OverheadYizhong Liu, Boyu Zhao, Yuxuan Hu, Haojun Tan et al.USENIX Security 2026
Related papers
- CoChain: High Concurrency Blockchain Sharding via Consensus on ConsensusMingzhe Li, You Lin, Jin Zhang, Wei WangINFOCOM 2023 · 42 citations
- GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness DichotomyBernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen et al.CCS 2022 · 25 citations
- Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized OverheadYizhong Liu, Andi Liu, Yuan Lu, Zhuocheng Pan et al.NDSS 2025
- Optimal Sharding for Scalable Blockchains with Deconstructed SMRJianting Zhang, Zhongtang Luo, Raghavendra Ramesh, Aniket KateVLDB 2025 · 7 citations
- Areopagus: Asynchronous Sharding Blockchain Tolerating Corrupted Shards with Optimized OverheadYizhong Liu, Andi Liu, Yuxuan Hu, Jin Dong et al.CCS 2026
