Provable data deletion from efficient data integrity auditing and insertion in cloud storage

Abstract

With the widespread popularity of cloud storage, a growing number of data owners are willing to outsource their massive data to remote cloud servers, thus effectively avoiding the heavy burden of storing and managing the massive data by themselves in local physical storage mediums. Despite the tremendous advantages, cloud storage inescapably suffers from some severe security challenges resulting from the separation of outsourced data management and its ownership, such as data integrity, data deletion, and data insertion. In this paper, we aim to deal with the problems of integrity auditing, dynamic insertion and provable deletion over outsourced data. Specifically, we design a novel authentication data structure, namely, number-rank-based Merkle hash tree (NR-MHT), which can achieve data dynamic operations. Meanwhile, NR-MHT can maintain many data blocks in each leaf node, thus effectively solving the problem of the height indefinitely increases with the total number of data blocks. Subsequently, we adopt NR-MHT to propose a new provable data deletion scheme based on efficient data integrity auditing and dynamic data insertion. In our presented scheme, the data owner can not only permanently delete the unnecessary outsourced data blocks to save storage expenditures but also efficiently insert new data blocks to dynamically update the outsourced data set. Meanwhile, we analyze the security to formally demonstrate that our presented scheme can satisfy all of the expected security requirements without interacting with a third party auditor. Finally, we also develop a prototype implementation of our presented scheme and provide an accurate efficiency evaluation. The numerical analysis and experimental results show that compared with the existing schemes, our presented scheme is more attractive in efficiency and practicability.