Butian Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Butian Huang has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Sheng Cao
University of Electronic Science and Technology of China
2 shared publications - Xiaosong Zhang
University of Electronic Science and Technology of China
2 shared publications Yingjie Xia
2 shared publications- Dongjing Wang
Hangzhou Dianzi University
1 shared publication - Erteng Liu
State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China
1 shared publication Hongbo Wang
1 shared publication
Latest Publications
- Top Cited Papers
- 14 May 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 346
MCD4SR: Multimodal collaborative denoising with modality balancing for sequential recommendation
- 14 May 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 346
Top Cited PapersMCD4SR: Multimodal collaborative denoising with modality balancing for sequential recommendation
- 2 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 3615-3629
CShard: Blockchain Sharding via Repairable Fountain Codes and the Paradigm for Sharding Design
Sharding is an important solution to improve the scalability of blockchain. The basic idea of blockchain sharding is to separate transactions among multiple disjoint shards processing in parallel to maximize system performance. The current sharding protocols mainly rely on node rotation (namely, node allocation and migration) randomly among shards periodically to ensure security, which is often considered the most challenging when developing a sharding system. However, (1) if a shard or multiple shards are corrupted, the sharding system will not be available anymore; (2) to avoid shard corruption, the demand of large size of each shard limits the throughput performance of sharding protocols. To solve (1), we introduce a blockchain sharding protocol with scale-out transaction processing capacity called CShard. The main idea of CShard is to use repairable fountain codes (RFCs), an information coding method with the locality feature, to innovate sharding design. By adjusting encoding parameters, topological associations among shards are constructed, which are then utilized to define the verification logic for transactions. The blocks of corrupted shard(s) can be recovered through decoding by its corresponding shard group(s), and the sharding system is still secure and available. Our approach utilizes encoding techniques to build a general architecture of a sharding system, establishing a paradigm of “encoding as verification” and showcases new horizons in the field of blockchain sharding. To solve (2), we propose the ghost reporter mechanism that gives all nodes chances to verify a transaction by submitting reports in the sharding network. The mechanism brings two direct benefits. Firstly, it provides the way to detect corrupted shards and recover the blocks by RFCs; the second is to make the number of nodes in a single shard smaller, which solves the limitation of existing sharding schemes that usually require a larger number of nodes in a single shard to ensure security. In principle, this mechanism can also be applicable to the known and even unknown sharding protocols for its generality.
- 2 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 3615-3629
CShard: Blockchain Sharding via Repairable Fountain Codes and the Paradigm for Sharding Design
Sharding is an important solution to improve the scalability of blockchain. The basic idea of blockchain sharding is to separate transactions among multiple disjoint shards processing in parallel to maximize system performance. The current sharding protocols mainly rely on node rotation (namely, node allocation and migration) randomly among shards periodically to ensure security, which is often considered the most challenging when developing a sharding system. However, (1) if a shard or multiple shards are corrupted, the sharding system will not be available anymore; (2) to avoid shard corruption, the demand of large size of each shard limits the throughput performance of sharding protocols. To solve (1), we introduce a blockchain sharding protocol with scale-out transaction processing capacity called CShard. The main idea of CShard is to use repairable fountain codes (RFCs), an information coding method with the locality feature, to innovate sharding design. By adjusting encoding parameters, topological associations among shards are constructed, which are then utilized to define the verification logic for transactions. The blocks of corrupted shard(s) can be recovered through decoding by its corresponding shard group(s), and the sharding system is still secure and available. Our approach utilizes encoding techniques to build a general architecture of a sharding system, establishing a paradigm of “encoding as verification” and showcases new horizons in the field of blockchain sharding. To solve (2), we propose the ghost reporter mechanism that gives all nodes chances to verify a transaction by submitting reports in the sharding network. The mechanism brings two direct benefits. Firstly, it provides the way to detect corrupted shards and recover the blocks by RFCs; the second is to make the number of nodes in a single shard smaller, which solves the limitation of existing sharding schemes that usually require a larger number of nodes in a single shard to ensure security. In principle, this mechanism can also be applicable to the known and even unknown sharding protocols for its generality.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 7644-7658
A Secure Self-Sovereign Identity Scheme Based on Soulbound Token and Trusted Personal Data Space
Self-Sovereign Identity (SSI) aims to enable a physical-world persona to autonomously own and manage his digital identity, which serves as a mapping of his real-world identity into cyberspace and has become an essential paradigm in trusted digital identity management. Although current state-of-the-art SSI schemes provide security properties such as Sybil-resistance, privacy-preserving, or regulation, they typically employ static identifier(s) to represent a persona's identity, rendering them vulnerable to identity forgery or theft, and they still fail to simultaneously address the problems of privacy leakage, Sybil attacks, and inadequate regulation. To overcome these limitations, we propose a secure self-sovereign identity scheme that integrates SoulBound Token (SBT) and a trusted personal data space. In our design, each physical-world persona has a unique, individual-specific identity engine generated from verified biometric data and metadata, with a non-transferable SBT bound to it via a smart contract, thereby enhancing resistance to Sybil attacks and making the identity misappropriation significantly harder. To further prevent an identity from being linked by service providers, we construct a distinct child identity engine for each service using behavioral history stored in a trusted personal data space. Moreover, we design a conditional and collaborative regulation mechanism that ensures malicious digital identities and service providers are traceable and subject to supervision. Finally, we perform a security and performance analysis to demonstrate that our scheme is practical, secure, and offers several advantages over state-of-the-art solutions.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 7644-7658
A Secure Self-Sovereign Identity Scheme Based on Soulbound Token and Trusted Personal Data Space
Self-Sovereign Identity (SSI) aims to enable a physical-world persona to autonomously own and manage his digital identity, which serves as a mapping of his real-world identity into cyberspace and has become an essential paradigm in trusted digital identity management. Although current state-of-the-art SSI schemes provide security properties such as Sybil-resistance, privacy-preserving, or regulation, they typically employ static identifier(s) to represent a persona's identity, rendering them vulnerable to identity forgery or theft, and they still fail to simultaneously address the problems of privacy leakage, Sybil attacks, and inadequate regulation. To overcome these limitations, we propose a secure self-sovereign identity scheme that integrates SoulBound Token (SBT) and a trusted personal data space. In our design, each physical-world persona has a unique, individual-specific identity engine generated from verified biometric data and metadata, with a non-transferable SBT bound to it via a smart contract, thereby enhancing resistance to Sybil attacks and making the identity misappropriation significantly harder. To further prevent an identity from being linked by service providers, we construct a distinct child identity engine for each service using behavioral history stored in a trusted personal data space. Moreover, we design a conditional and collaborative regulation mechanism that ensures malicious digital identities and service providers are traceable and subject to supervision. Finally, we perform a security and performance analysis to demonstrate that our scheme is practical, secure, and offers several advantages over state-of-the-art solutions.
- Open Access
- 10 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 114-122
Efficient Balancing A* Search for Multi-robot Collaboration With Blockchain Consensus
- 10 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 114-122
Open AccessEfficient Balancing A* Search for Multi-robot Collaboration With Blockchain Consensus