Quantum-Resistant Merkle Trees Enhancing Data Integrity with Post-Quantum Cryptography and Zero-Knowledge Proof
Keywords:
Quantum-Resistant Merkle Tree (QRMT), zk-STARKs (Zero-Knowledge Scalable Transparent Arguments of Knowledge), Lattice-based Cryptography, Hash Function Randomization, Grover's Algorithm, Kyber1024, Shor's AlgorithmAbstract
Exponential advancements in quantum computing threaten existing cryptographic structures, including Merkle Trees, due to their dependence on classical hash functions and public-key encryption schemes. The paper presents QRMT as a new cryptographic structure that implements zk-STARKs along with lattice-based cryptography and hash function randomization to achieve improved security and better performance. Benchmarks demonstrate that QRMT reduces proof generation time by 28–32% compared to classical Merkle Trees under Grover’s algorithm attacks, while maintaining logarithmic-scale verification efficiency. The QRMT utilizes a hash selection strategy that consists of SHAKE-256 Blake3 and Poseidon hash functions, which protect against Grover’s algorithm attacks. The metadata encryption measures security through Kyber1024, which uses lattice-based public-key encryption to replace RSA and prevent attacks using Shor’s algorithm. Kyber1024 generates keys in ~0.005 ms, which is 75 ms faster than RSA-4096’s. The zk-STARK-verified process allows for trustless and extensive proof verification while protecting confidential information. Our proof-of-concept instance maintains efficient behavior because proof creation and verification times grow at less than a logarithmic rate while the data collection expands. This framework creates quantum resistance for blockchain security, which enables distributed secure systems and establishes new cryptographic technology options.
Downloads
Published
How to Cite
Issue
Section
License
This is an open Access Article published by Research Center of Computing & Biomedical Informatics (RCBI), Lahore, Pakistan under CCBY 4.0 International License