Optimizing data retrieval for enhanced data integrity verification in cloud environments

Abstract

Abstract In today’s rapidly evolving digital landscape, the urgency to secure data within expansive cloud storage systems has reached unprecedented levels. Conventional remote storage methods, while widely used, are inherently vulnerable to security breaches, corruption, and tampering. Recognizing this critical challenge, a state-of-the-art protocol has emerged to address these vulnerabilities head-on. This innovative solution integrates a sophisticated binary search tree (BST) structure with elliptic curve cryptography, ensuring not only efficient data retrieval but also robust encryption mechanisms. The protocol goes further by meticulously computing secure hashing algorithm hash values to verify the integrity of files, leaving no room for unauthorized modifications or tampering attempts. A thorough comprehensive benchmarking analysis has been conducted comparing this protocol with established techniques such as Rivest, Shamir, Adleman encryption and doubly linked list-based index table structures. The findings reveal that the proposed protocol outperforms these conventional methods, showcasing superior security features and computational efficiency. Remarkably, the proposed method reduces overheads by an impressive 5%, making it a highly favorable choice for both businesses and academic institutions. This marks a significant advancement toward fortified data security in cloud environments, contributing substantially to the ongoing discourse on secure data storage and management.