Research Of Data Integrity Verification Scheme In Cloud Storage

Owning to the mass storage capability and low cost of cloud storage,many people are attended to store their data in cloud.Meanwhile,the characteristics of the cloud storage in processing data anytime and anywhere provide significant convenience for the users.However,due to the large size of the cloud storage system,and its unprecedented openness and complexity,so the security of the data stored in cloud storage facing severe challenges.In order to ensure the safety of the data in the cloud,the user needs to periodically verify the data integrity.This paper focuses on the issue that the data integrity verification scheme in cloud storage.It can be found that the existed data integrity verification.schemes for cloud storage still have some limitations:some schemes can not support dynamic operations,some can not simultaneously verify the integrity of multiple copies of data,and some are inefficient.To overcome the above limitations,two novel data integrity verification scheme is proposed in this paper which can support multiple copies and dynamic operation.The main work of this paper are as follows:1)A dynamic data integrity verification scheme of multi-copy based on spatiotemporal chaos is proposed.The scheme uses the spatiotemporal chaos method to calculate the binary tree node value,and the initial sensitivity of the chaotic system can ensure the reliability and safety of the verification.Furthermore,the structure of the binary tree can flexibly support the dynamic update of data.Moreover,the third party instead of the user to verify the integrity of the data,but the third party is not credible in this scheme,hence adding the blind information is used to prevent the third-party auditor leakage of the users' data privacy in the verification process.Experiments show that the scheme has advantages over existing solutions in terms of computational overhead,storage overhead and communication overhead.2)A dynamic data integrity verification scheme of multi-copy based on full-node of AVL tree is proposed.Improving the efficiency of searching the data block by using the characteristics of AVL tree,which can keep the balance of the tree after the dynamic operation.Besides,each node in the AVL tree corresponds to a data block,and the Henon chaotic mapping method is used in the calculation of node values in the AVL tree,which greatly reduces the storage cost of the cloud server.Moreover,this scheme can also locate the wrong data block.Experiments show that the scheme can reduce the storage cost of the cloud server.