An enhanced data integrity verification model in cloud computing
Khumalo, Nomsa L.
Khumalo, Nomsa L.
Citations
Altmetric:
Abstract
Cloud computing provides users with the ability to utilize computing resources such as servers, storage, and applications through internet-based utility services, thereby eliminating the necessity for expensive investment in hardware or software. However, data Integrity (DI) in cloud computing is beset by a multitude of challenges encompassing intricacy, data security, privacy concerns, limited control, human error, and associated costs. The existing DI solutions have exhibited insufficiencies in addressing issues pertaining to data verification, prevention of replay attacks, and managing of computational overhead. Consequently, there is a growing requirement for third-party verifiers to access cloud environments. To confront these challenges effectively, a hybrid DI approach known as CAPDP-MHT has been introduced, which combines the strengths of the cryptographic accumulator provable data possession (CAPDP) with Merkle HashTree (MHT). The CAPDP-MHT scheme serves to ensure the security of data by preventing unauthorized alterations, preserving data accuracy and freshness, and by thwarting replay attacks. Through simulation and evaluation utilizing MATLAB, the C APDP-MHT scheme showcases superior performance compared with both the provable data possession algorithm (PDP) algorithm and the Ron Rivest, Adi Shamir, and LeonardAdleman (RSA) algorithms in the domains of data verification, prevention of replay attacks, and management of computational overhead. Specifically, the proposed CAPDPMHT scheme achieves an average data verification rate of 25%; whereas PDP and RSA models attain rates of 10% and 5%, respectively. The CAPDP-MHT scheme is capable of detecting replay attacks within a span of 30 seconds, while the PDP and RSA algorithms require 45 and 70 seconds, respectively. Furthermore, the CAPDP-MHT scheme incurs approximately 27 seconds of computational overhead, as opposed to the 45 and 60 seconds needed by the PDP and RSA algorithms. Consequently, the CAPDPMHT scheme not only outperforms in terms of reliability but also offers superior computational efficiency compared with schemes based on PDP and RSA.
Description
Dissertation submitted in partial fulfilment of the requirements for the degree Master of Computing in Information Technology in the Department of Information Technology in the Faculty of Information and Communication at Technology at Tshwane University of Technology.
Date
2023-10-01
Journal Title
Journal ISSN
Volume Title
Publisher
Tshwane University of Technology
Research Projects
Organizational Units
Journal Issue
Keywords
Cloud Computing., Data Integrity., Cryptographic Accumulator Provable Data Possession., Merkle Hash Tree algorithm., Data Verification.