2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 O(n³) that limits scalability in large networks. To address these issues, this paper proposes an efficient blockchain editing scheme designed for large-scale network environments. The proposed scheme replaces traditional hash functions with chameleon hash functions in the Merkle root generation process to achieve seamless editing. By utilizing proxy nodes for information aggregation, the scheme reduces communication complexity from O(n³) to O(n²). Homomorphic encryption secures trapdoor and masking data, enabling encrypted aggregation and eliminating node dependency on these values. Additionally, the integration of zero-knowledge proofs and commitment mechanisms supports the identification and exclusion of malicious nodes, ensuring stable operation with accurate information. Experiments conducted on 211 blockchain nodes deployed across four cities demonstrate that the proposed scheme outperforms existing methods in efficiency, with its performance advantages becoming increasingly pronounced as network size grows. Fur thermore, rigorous security proofs under the ideal-real model validate the scheme's strong security properties, showcasing its potential for practical application in large-scale blockchain networks.]]> 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:18 2026/6/4 19:42:19 2026/6/4 19:42:19 2026/6/4 19:42:19 -61 and the modulus is reduced to 12289, which further decreases the amount of calculation and communication complexity. The protocol is implemented in C++ with NFL (NTT-based Fast Lattice) acceleration algorithm, which accelerates the polynomial multiplication and significantly improves the efficiency of the entire protocol. The results in practice show the protocol achieves at most 17x speedup and provides 255-bit quantum security.]]> 2026/6/4 19:42:19