A New Outsourced Data Deletion Scheme with Public Verifiability

Yang, Changsong; Tao, Xiaoling; Zhao, Feng; Wang, Yong

doi:10.1007/978-3-030-23597-0_53

Cited by 9 publications

(19 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, we increase the number of deleted data blocks from 10 to 100 with a step for 10, and then Figure 11 shows the time overhead comparison among our proposed scheme and the other three schemes. 16,24,40 From Figure 11, we can easily find that the time cost of scheme 16 is constant, which is different from the other three schemes. Fortunately, the growth rate of our proposed scheme is lower than these of schemes.…”

Section: Simulation Resultsmentioning

confidence: 94%

“…Meanwhile, although the time cost increases with the number of outsourced data blocks, the growth rate of our proposed scheme is relatively lower than these of the other two schemes. 24,40 Moreover, note that the data storage operation not only is one-time but also is accomplished off-line. Therefore, we can think that our proposed scheme is much more efficient than the other two schemes 24,40 in data storage process.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Boneh and Lipton 33 proposed the first cryptography-based solution to process the secure data deletion problem, with a series of follow-up schemes. 20,24,[34][35][36] Recently, Yu et al 37 adopted attribute-based encryption to design a new assured data deletion protocol, which can also simultaneously achieve fine-grained access control. Hao et al 16 used trusted platform model (TPM) to design a publicly verifiable deletion scheme for secret data.…”

Section: Related Workmentioning

confidence: 99%

“…We consider the verifiable data deletion model in cloud storage, which is very similar to schemes. 20,24 In our scenario, there is a trust problem between the data owner and the cloud server. That is, the data owner does not believe that the cloud server might honestly execute data insertion and deletion operations.…”

Section: Overviewmentioning

confidence: 99%

“…In this part, we compare the functionality of the proposed scheme with three existing solutions 16,24,40 in theory, and the comparison results are shown in Table 1.…”

Section: Functionality Comparisonmentioning

confidence: 99%

See 4 more Smart Citations

Assure deletion supporting dynamic insertion for outsourced data in cloud computing

Yang

Liu

Tao

2020

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

With the rapid development of cloud computing, an increasing number of data owners are willing to employ cloud storage service. In cloud storage, the resource-constraint data owners can outsource their large-scale data to the remote cloud server, by which they can greatly reduce local storage overhead and computation cost. Despite plenty of attractive advantages, cloud storage inevitably suffers from some new security challenges due to the separation of outsourced data ownership and its management, such as secure data insertion and deletion. The cloud server may maliciously reserve some data copies and return a wrong deletion result to cheat the data owner. Moreover, it is very difficult for the data owner to securely insert some new data blocks into the outsourced data set. To solve the above two problems, we adopt the primitive of Merkle sum hash tree to design a novel publicly verifiable cloud data deletion scheme, which can also simultaneously achieve provable data storage and dynamic data insertion. Moreover, an interesting property of our proposed scheme is that it can satisfy private and public verifiability without requiring any trusted third party. Furthermore, we formally prove that our proposed scheme not only can achieve the desired security properties, but also can realize the high efficiency and practicality.

show abstract

Section: Simulation Resultsmentioning

confidence: 94%

Section: Simulation Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Overviewmentioning

confidence: 99%

“…In this part, we compare the functionality of the proposed scheme with three existing solutions 16,24,40 in theory, and the comparison results are shown in Table 1.…”

Section: Functionality Comparisonmentioning

confidence: 99%

See 3 more Smart Citations