Abstract
Recently, permissioned blockchain has been extensively explored in various fields, such as asset management, supply chain, healthcare, and many others. Many scholars are dedicated to improving its verifiability, scalability, and performance based on sharding techniques, including grouping nodes and handling cross-shard transactions. However, they ignore the node vulnerability problem, i.e., there is no guarantee that nodes will not be maliciously controlled throughout their life cycle. Facing this challenge, we propose RecAGT, a novel identification scheme aimed at reducing communication overhead and identifying potential malicious nodes. First, shard testable codes are designed to encode the original data in case of a leak of confidential data. Second, a new identity proof protocol is presented as evidence against malicious behavior. Finally, adaptive group testing is chosen to identify malicious nodes. Notably, our work focuses on the internal operation within the committee and can thus be applied to any sharding permissioned blockchains. Simulation results show that our proposed scheme can effectively identify malicious nodes with low communication and computational costs.
Introduction
Permissioned blockchains are the preferred choice for enterprise solutions like supply chain management and healthcare due to their controlled access and high performance. To achieve scalability, these systems often employ sharding, which partitions the network into smaller "committees" that handle specific subsets of data.
However, a critical security gap remains: node vulnerability. Even if a node is authenticated upon joining, it may be compromised later through cyberattacks such as BGP hijacking or Eclipse attacks. If a malicious node provides "perturbed" (fake) data to a newly joined member, it can disrupt the entire committee's operations. Traditional methods for identifying these malicious actors—such as requiring every node to send its entire dataset to the newcomer—are bandwidth-heavy, computationally expensive, and risk leaking confidential information.
The RecAGT Framework
To address these challenges, we propose RecAGT (Recoverable codes with Adaptive Group Testing). The system is built upon three primary pillars designed to ensure privacy, accountability, and efficiency:
- Shard Testable Codes: Instead of transmitting raw data, nodes utilize a linear encoding function inspired by polynomial codes. Data is divided into $m$ sub-shards and encoded using unique scalars. This mathematical structure (based on a Vandermonde matrix) allows a receiver to verify data integrity via polynomial interpolation. If the verification result is non-zero, it indicates the presence of a malicious actor.
- Identity Proof Protocol: To prevent identity forgery, a two-step digital signature process involving a Central Authority (CA) is implemented. This creates a "fraud-proof" trail; if a node provides corrupted data, the newcomer can present the signed message to the CA as undeniable evidence of malice.
- Adaptive Group Testing (AGT): Rather than testing nodes individually, RecAGT employs an adaptive group testing strategy. If a group test passes, all nodes in that group are cleared. If it fails, the group is subdivided and re-tested. This approach significantly minimizes the number of trials required to isolate specific malicious nodes.
Performance Analysis
The performance of RecAGT was evaluated through theoretical simulations involving up to 1,800 nodes. The scheme was compared against two baselines: Uncoded (sending raw data) and Checksum (sending hashes).
Key Results
- Communication Efficiency: RecAGT achieves a communication cost of $O(b)$ (where $b$ is the shard size), which is significantly lower than the $O(nb)$ required by uncoded methods, where $n$ is the number of nodes.
- Computational Speed: By treating verification as a polynomial interpolation problem, computational complexity is reduced from quadratic $O(n^2)$ to nearly logarithmic $O(\log^2(m) \log \log(m))$. In tests with a 256 MB shard, the Uncoded method took over 10,000 seconds to verify, while RecAGT remained nearly constant and exponentially faster.
- Privacy Preservation: Because verification relies on coded shards, the internal data of an organization remains confidential during the identification process, a critical requirement for permissioned enterprise chains.
Conclusion and Future Work
RecAGT provides a robust and efficient mechanism for identifying malicious nodes in sharded blockchains without compromising data privacy. While the current implementation assumes a trustworthy Central Authority, future research will explore more decentralized trust models. Additionally, the authors plan to investigate advanced variants of Adaptive Group Testing and the application of RecAGT in dynamic "resharding" environments where nodes frequently move between committees.
Summary updated