A SECURE AND SCALABLE BLOCKCHAIN MODEL FOR DATA MANAGEMENT USING ATTRIBUTEBASED CRYPTOGRAPHY

Authors

  • K. VIJAYA LAXMI 1 , MUPPAVARAM UMAMAHESHWARI 2 , THUMU MANOJ KUMAR 3 , JINKALA SAI PRASANNA 4 , ETTE TANVI SWATHI 5 Author

DOI:

https://doi.org/10.5281/zenodo.21100639

Abstract

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

29-06-2026

How to Cite

A SECURE AND SCALABLE BLOCKCHAIN MODEL FOR DATA MANAGEMENT USING ATTRIBUTEBASED CRYPTOGRAPHY. (2026). International Journal of Engineering Research and Science & Technology, 22(2(4), 133-143. https://doi.org/10.5281/zenodo.21100639