Research Of Cloud Storage Provable Data Possession

With the development of computer network technology,the information in our lives grows explosively.The traditional data storage methods can not satisfy people's needs for data management.The development of cloud storage has become overwhelming.However,there are also many security issues in cloud storage systems.For example,cloud storage data is often stolen or distorted,resulting in insecure data storage.How to verify the integrity of cloud storage data effectively has become the most important thing.In this paper,in the process of studying the provable data possession schemes,Chameleon Hash and its aggregation are used to improve the provable data possession scheme based on Binary Ordered-Merkle Hash Tree.The improved scheme allows the user to deliver tasks of generating data block tags to the cloud storage,thus reduces the user's calculations.This paper separately simulates the improved scheme and the original scheme,and analyzes the performance of the two schemes by comparing the simulation results.The simulation results show that the improved scheme has higher efficiency.A scheme based on dynamic data integrity verification and recovery is also improved in this paper.This improved scheme improves the efficiency of verifying data blocks location and Hash Tree storage by hashing the representative values of data blocks.Moreover,the Chinese Remainder Theorem is used to design an algorithm for recovering damaged data blocks in this paper.With a good copy,it can recover damaged data blocks with relatively little time.Finally,the different stages of the two schemes are simulated in this paper,the simulation results show that the improved scheme has higher efficiency.