Efficient data transfer supporting provable data deletion for secure cloud storage

被引:0
作者
Changsong Yang
Yueling Liu
Yong Ding
机构
[1] Guilin University of Electronic Technology,Guangxi Key Laboratory of Cryptography and Information Security
[2] Guilin University of Electronic Technology,Guangxi Cooperative Innovation Center of Cloud Computing and Big Data
[3] Guilin University of Electronic Technology,Business School
[4] Peng Cheng Laboratory,Cyberspace Security Research Center
来源
Soft Computing | 2022年 / 26卷
关键词
Cloud storage; Outsourced data; Data transfer; Data deletion; CBFT; RMHT; Verifiability;
D O I
暂无
中图分类号
学科分类号
摘要
With the widespread popularity of cloud storage, a growing quantity of tenants prefer to upload their massive data to remote cloud data center for saving local cost. Due to the great market prospect, a large quantity of enterprises provide cloud storage services, which are equipped with different prices, reliability, security, and so on. Hence, outsourced data transfer has become a fundamental requirement for tenants to flexibly change cloud service providers (CSPs) to enjoy more suitable services. Nevertheless, how to guarantee the data integrity when the data are transferred from a cloud data center to another is a concern of tenants. To solve this concern, we design a new validation data structure, namely, counting Bloom filter tree (CBFT), which can be viewed as a specific binary tree based on CBF. Then, we present an efficient outsourced data transfer scheme supporting provable data deletion, in which tenants can flexibly change CSPs and transfer their outsourced data blocks from a cloud data center to another without retrieving them. At the same time, after the data are successfully transferred, tenants can validate the transferred data integrity and usability on the new cloud data center and permanently delete the transferred data from the old cloud data center. Moreover, the formal security analysis proves that our new solution can achieve all of the anticipant security goals without interaction with a third party. At last, we develop a prototype system and implement our new solution, thus providing accurate performance evaluation, which intuitively presents the high efficiency and practicality of our new solution.
引用
收藏
页码:6463 / 6479
页数:16
相关论文
共 79 条
[1]  
Bentajer A(2019)An IBE-based design for assured deletion in cloud storage Cryptologia 43 254-265
[2]  
Hedabou M(1970)Space/time trade-offs in hash coding with allowable errors Commun ACM 13 422-426
[3]  
Abouelmehdi K(2020)Hybrid context aware recommendation system for e-health care by merkle hash tree from cloud using evolutionary algorithm Soft Comput 24 7149-7161
[4]  
Bloom BH(2000)Summary cache: a scalable wide-area web cache sharing protocol IEEE/ACM Trans Netw 8 281-293
[5]  
Deepa N(2010)False negative problem of counting bloom filter IEEE Trans Knowl Data Eng 22 651-664
[6]  
Pandiaraja P(2018)Data migration for large scientific datasets in clouds Azerbaijan J High Perform Comput 1 66-86
[7]  
Fan L(2015)Deleting secret data with public verifiability IEEE Trans Dependable Secure Comput 13 617-629
[8]  
Cao P(2015)Complement bloom filter for identifying true positiveness of a bloom filter IEEE Commun Lett 19 1905-1908
[9]  
Almeida J(2014)Mur-dpa: Top-down levelled multi-replica merkle hash tree based secure public auditing for dynamic big data storage on cloud IEEE Trans Comput 64 2609-2622
[10]  
Guo D(2014)Page replacement algorithm based on counting bloom filter for nand flash memory IEEE Trans Consum Electron 60 636-643