A Low-Overhead Auditing Protocol for Dynamic Cloud Storage Based on Algebra

Abstract

With the widespread adoption of cloud storage, ensuring the integrity of outsourced data has become increasingly important. Various cloud storage auditing protocols based on public key cryptography have been proposed. However, all of them require complex cryptographic operations and incur significant storage and communication costs. To address the issues of significant storage overhead for data tags, high computational complexity of cryptographic algorithms, and limited efficiency of dynamic data algorithms in signature algorithm-based cloud storage outsourcing data integrity verification protocols, we propose a dynamic auditing protocol called AB-DPDP, which is based on algebra. Our protocol reduces the computational complexity of tag generation by utilizing basic algebraic operations instead of the traditional cryptographic method used in most current auditing protocols. To reduce storage overhead and protect private data, our protocol stores only tags, allowing for data to be restored through these tags, as opposed to storing both tags and data on the cloud server. To accommodate for more frequent and efficient data dynamics, we propose the dynamic index skip table data structure. Furthermore, the security of our proposed protocol is thoroughly proven based on the security definition of secure cloud storage. Finally, through theoretical analysis and experimental evaluation, we demonstrate the advantages of our scheme in terms of data privacy, storage overhead, communication overhead, computation overhead, and data dynamic efficiency.