With the advent of low-cost and highly scalable cloud storage services,more and more users choose to transfer their own data to the cloud server.This largely saves the storage consumption of users’ data and post-maintenance costs.At the same time,the user also loses the absolute control of remote data,so the integrity of the data information stored on the cloud server is unknown to the user.Therefore,the user needs to confirm that the cloud server has completely saved the data through an efficient auditing mechanism.Users can access data stored in the cloud at any time,and may also need to modify the data that has been saved in the cloud.In this application scenario,the content of data integrity verification should also include whether the cloud server has correctly updated the user’s data.In addition,multi-replicated storage of user data files is an important way to ensure and improve the quality of storage services.In the case of multiple copies of storage,it is also necessary to audit the integrity of the copy information deployed on each server.In view of the above data integrity verification requirements,this article researches and analyzes the data integrity auditing scheme that supports dynamic update and the multi-copy data integrity auditing scheme.First,analyzing the existing dynamic data integrity auditing scheme,a data integrity verification mechanism based on a single linked list large branching tree(SLBT)is proposed.The SLBT is compared with the large branching tree(LBT)proposed by Li and Yao,the SLBT tree height decreases with the increase of the storage space of the linked list relatively.Reducing the tree height means that the intermediate nodes will be reduced when constructing the tree structure.The reduction of the intermediate nodes improves the space storage efficiency of the data,and reducing the tree height means that reducing the computational complexity of the root node,thus reducing the computational spending of cloud storage servers.The experiment proves that this mechanism has been effectively improved in aspect of data storage efficiency.Secondly,through the research and analysis of the existing supporting multi-copy data integrity auditing scheme,this paper proposes a multi-copy data availability auditing scheme based on BLS signature.In this scheme,multiple replicas correspond to only one tag value at the same time,which greatly reduces the authentication tag information required for verification,thereby effectively reducing the calculation,communication,and storage spending of the authentication tag in thesystem;by the means of introducing a seed mapping table,the scheme solves the problem of multiple copies of synchronous data modification and supports dynamic update of multiple copies.Finally,through theoretical analysis and experimental simulation,the proposed scheme can correctly and efficiently verify the integrity of multiple copies of data. |