Abstract
SummaryAs the demand for cloud storage systems increases, ensuring the security and integrity of cloud data becomes a challenge. Data uploaded to cloud systems are vulnerable to numerous sorts of assaults, which must be handled appropriately to avoid data tampering issues. In addition, quantum computers are expected to be introduced soon, which may face multiple security issues by destroying all traditional cryptosystems. This work introduces a quantum‐resistant blockchain centered data integrity verification system with the use of several techniques. Initially, the keys and signatures are generated by the users with the help of the lattice‐based blind signature algorithm (L_BSA), which is a combination of lattice cryptography and a blind signature algorithm. From the generated random keys, the most optimal key is then selected by the Puzzle Optimization Algorithm (POA), which is then made available to the encryption phase. Then, the upgraded Merkle tree‐assisted vacuum filter (Vac‐UMT) algorithm is executed to accomplish the encryption task. Then the data are converted into blocks using blockchain technology and uploaded to the cloud. When receiving the audit requests, the verification process is carried out, and the evidence report is generated for the users. The proposed work is simulated in JAVA and assessed with the UNSW‐NB15 dataset, and the outcomes demonstrated that the system is highly efficient and secure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.