A SECURE AND SCALABLE BLOCKCHAIN MODEL FOR DATA MANAGEMENT USING ATTRIBUTEBASED CRYPTOGRAPHY
DOI:
https://doi.org/10.5281/zenodo.21100639Abstract
Traditional blockchain systems rely on Merkle trees built from classical hash functions like SHA-256, which face growing challenges from quantum computing threats and scalability limitations in large-scale data verification. To address these issues, we propose a parameterhopping Merkle tree framework that integrates a pseudorandom number generator (PRNG) with lattice-based cryptography. Our design introduces dynamically generated lattice parameters to enhance post-quantum security and improve flexibility for distributed data storage and verification. The system constructs a provably secure hash chain using extended-domain lattice-based hash functions (LBHFs), supporting arbitrary-length inputs and enabling adaptive, efficient verification in peer-to-peer environments. Experimental validation in a cloud storage scenario demonstrates that the proposed approach achieves stronger quantum resilience while maintaining high efficiency and reduced proof sizes compared to traditional blockchain infrastructures.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.













