An Improved Data Integrity Verification Model in Cloud Computing

Cloud computing eliminates the need for expensive hardware and software expenditures by revolutionising access to computing resources through internet-based utility services. However, Data Integrity (DI) in this paradigm faces a variety of challenging issues, including complexity, security, privacy, control limits, fallibility of human beings, and financial limitations. The shortcomings of current DI solutions in terms of guaranteeing data verification, preventing replay attacks, and controlling computational overhead have led to an increasing need for access to cloud infrastructures by third-party verifiers. The suggested Cryptographic Accumulator Provable Data Possession with Merkle Hash Tree (CAPDP-MHT) scheme demonstrates significantly improved performance over Provable Data Possession (PDP) and Rivest Shamir Adleman (RSA) algorithms in various domains, as demonstrated by thorough simulation and MATLAB-based evaluation. In particular, CAPDP-MHT outperforms PDP and RSA with an average data verification success rate of 25%, compared to their respective rates of 10% and 5%. Moreover, it identifies replay attacks in about 30 seconds, compared to 45 and 70 seconds for PDP and RSA, respectively. Furthermore, the computational overhead of CAPDP-MHT is about 27 seconds, while that of PDP and RSA is 45 and 60 seconds, respectively. Therefore, as compared to PDP and RSA-based systems, CAPDP-MHT not only exhibits exceptional computing efficiency but also outperforms in reliability.