Dynamic-Hash-Table Based Public Auditing for Secure Cloud Storage

Abstract

This research investigates the design and implementation of a public auditing system for secure cloud storage leveraging dynamic hash tables. The primary objective is to enhance the efficiency and security of data integrity verification while minimizing the computational overhead on both the cloud server and the data owner. The proposed system uses a dynamic hash table structure to efficiently manage data blocks and audit proofs, resulting in reduced storage and verification times compared to existing methods. Our evaluation demonstrates significant improvements in performance and security, offering a practical solution for secure and verifiable cloud storage.

Introduction

Cloud storage offers scalability and cost-effectiveness, but data integrity and security remain critical concerns. Public auditing allows a third-party auditor to verify data integrity without accessing the data itself, addressing trust issues between data owners and cloud providers. Existing public auditing schemes often suffer from performance bottlenecks, especially with large datasets, due to inefficient data management and proof generation. This research aims to address these limitations by proposing a novel approach that utilizes dynamic hash tables to optimize data organization and audit proof generation, leading to improved efficiency and scalability.

Objectives

• To design a secure public auditing scheme for cloud storage using dynamic hash tables.
• To improve the efficiency of audit proof generation and verification compared to existing methods.
• To ensure the scalability of the system to handle large datasets and high update rates.