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

• Published in: IEEE access Vol. 9; pp. 75117 - 75131
• Main Authors: Liu, Zhenpeng, Liu, Yi, Yang, Xianwei, Li, Xiaofei
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Cloud computing; Cloud storage; Communications systems; Cryptography; Data integrity; data integrity auditing; Data models; Data storage; dynamic data update; Heuristic algorithms; Integrity; red-black tree; Security; Servers
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2021.3079143

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.