Quantum-Resistant Merkle Trees Enhancing Data Integrity with Post-Quantum Cryptography and Zero-Knowledge Proof

Clicks: 2
ID: 312788
2025
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal

Ranked #682 of 705 articles by views in Journal of Computing & Biomedical Informatics

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 705 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
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.
Reference Key
imported_1777056842_69ebbc4a77db5 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Omer Irshad
Journal Journal of Computing & Biomedical Informatics
Year 2025
DOI
DOI not found
URL
https://jcbi.org/index.php/Main/article/view/950
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.