Public auditing scheme for cloud data with user revocation and data dynamics

Yang, Xiaodong; Liu, Tingting; Yang, Ping; An, Faying; Yang, Miaomiao; Xiao, Likun

doi:10.1109/itnec.2017.8284847

Cited by 4 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…worst case, but the red-black tree in our scheme only needs three times. As shown in Figure 12, our scheme is obviously more efficient than the scheme [20] and scheme [23] when a large number of insert and delete operations are required. The updated block number for some time(s)…”

Section: Figure 11 the Communication Overhead Of Integrity Verificationmentioning

confidence: 92%

“…In this section, our scheme is compared with other data integrity verification schemes such as schemes [20,23,31]. Scheme [20] is a dynamic operation scheme based on MHT, scheme [23] is a multi-copy data integrity verification based on spatiotemporal chaos and scheme [31] is a multi-copy data integrity verification based on ID signature. Therefore, it is a good contrast to compare these schemes we chose with our proposed scheme.…”

Section: Efficiency Analysismentioning

confidence: 99%

“…Figure 10 shows the calculation cost of evidence generation. It can be seen from the figure that our scheme, scheme [20] , scheme [23] and scheme [31] have a linear relationship with the number of challenged data blocks in the evidence generation stage, but our scheme overall more efficient. After the calculation cost is evaluated, the communication cost in the certification phase and the update phase will be evaluated.…”

Section: Figure 9 the Computational Overhead Of Label Generationmentioning

confidence: 99%

“…Our scheme adopts the red-black tree data structure, after inserting the data node, both of them only need two rotation operations at most. When deleting data nodes, the scheme [20] and scheme [23] requires O(logN) times in the This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/ This article has been accepted for publication in a future issue of this journal, but has not been fully edited.…”

Section: Figure 11 the Communication Overhead Of Integrity Verificationmentioning

confidence: 99%

“…At the same time, Yang et al [22] proposed a public cloud audit scheme for dynamic update of user data and revocation of user data, but it did not solve the problem of dynamic revocation at any time. Long et al [23] proposed an integrity verification scheme based on spatiotemporal chaos, which supports dynamic data analysis, blinding information, and preventing third parties from leaking user data privacy. Long et al [24] proposed a data integrity verification scheme based on a binary balanced tree.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Integrity Auditing for Multi-Copy in Cloud Storage Based on Red-Black Tree

Liu

Xian-wei

et al. 2021

IEEE Access

View full text Add to dashboard Cite

With the rapid development of cloud storage, cloud users are willing to store data in the cloud storage system, and at the same time, the requirements for the security, integrity, and availability of data storage are getting higher and higher. Although many cloud audit schemes have been proposed, the data storage overhead is too large and the data cannot be dynamically updated efficiently when most of the schemes are in use. In order to solve these problems, a cloud audit scheme for multi-copy dynamic data integrity based on red-black tree full nodes is proposed. This scheme uses ID-based key authentication, and improves the classic Merkel hash tree MHT to achieve multi-copy storage and dynamic data manipulation, which improves the efficiency of real-time dynamic data update (insertion, deletion, modification). The third-party audit organization replaces users to verify the integrity of data stored on remote cloud servers, which reduces the computing overhead and system communication overhead. The security analysis proves that the security model based on the CDH problem and the DL problem is safe. Judging from the results of the simulation experiment, the scheme is safe and efficient.

show abstract

Section: Figure 11 the Communication Overhead Of Integrity Verificationmentioning

confidence: 92%