Lightweight Non-Interactive Zero-Knowledge Proof Method for Data Transmission Consistency Verification

Abstract

The rapid advancement of big data and cloud computing technologies has elevated the importance of data transmission consistency verification in scenarios such as distributed storage, data backup, and content delivery networks. Traditional verification methods, including hash-based checks and digital signatures, inherently require access to raw data for computation and comparison. This dependency introduces risks of original data leakage and imposes substantial computational overhead in high-concurrency or large-scale data environments. Zero-knowledge proof (ZKP) technology offers a promising alternative by enabling a prover to demonstrate the validity of a statement to a verifier without disclosing any supplementary information. However, conventional ZKP schemes, particularly interactive ones, often suffer from complex communication rounds and significant computational burdens, rendering them unsuitable for data transmission scenarios demanding high real-time performance. This paper proposes a Lightweight Non-interactive Zero-Knowledge Proof (L-NIZK) protocol specifically designed for secure and efficient data transmission consistency verification. The protocol employs a data-blocking strategy combined with a Merkle tree structure and integrates an enhanced Pedersen commitment scheme with elliptic curve cryptography to achieve non-interactive and computationally efficient consistency proofs. A formal security analysis demonstrates that the proposed scheme satisfies completeness, soundness, and zero-knowledge properties under the random oracle model. Comprehensive performance evaluations indicate that the L-NIZK protocol surpasses existing mainstream solutions in proof generation time, verification time, and communication overhead, establishing its suitability for large-scale, high-concurrency data transmission environments.