arrow
返回

Efficient data transfer supporting provable data deletion for secure cloud storage

delete2022-04-30
delete1
PRE
AI
杨昌松 封面图
杨昌松 (Changsong Yang) *
Y
Yueling Liu
丁勇 封面图
丁勇 (Yong Ding)
DOI:10.1007/s00500-022-07116-6delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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.
Keyword:
Cloud storage
Outsourced data
Data transfer
Data deletion
CBFT
RMHT
Verifiability

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

G
Guilin University of Electronic Technology
学者数:
7.4K
论文数: 5.2K
被引数: 5.4K
引用论文

引用论文

False Negative Problem of Counting Bloom Filter
err2010-05-01
err51
errOAAI
errGuo, Deke; Liu, Yunhao; Li, Xiangyang; Yang, Panlong
err分享
err收藏
Sleep-Related Breathing Disorders and Cancer睡眠相关呼吸障碍与癌症
err2017-05-17
err0
PREAI
errDiwakar D. Balachandran; Lara Bashoura; Saadia A. Faiz
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容