Cloud Storage Data Integrity Verification Scheme And Its Improvements

In recent years,with the rapid development of computer technology and network communication,computer Internet technology has entered the era of cloud computing.With the increasing speed of informatization and the increasing demand of network,the amount of data generated in each application field has exploded,so the concept of cloud storage has been proposed.In the cloud storage,the data is stored on the cloud server,which may not be completely trusted.In this work,the integrity of data storage in cloud storage is studied.Erway et al.proposed the authentication mechanism based on the skip-list to maintain and verify data integrity by introducing the authentication skip-list with rank information.However,this scheme can only support the update of the single data block,and can not carry out batch.Wang et al.proposed a certification mechanism based on the Merkel hashing tree.This mechanism can support full dynamic operations and can also support open validation.However,in the verification process,a large number of auxiliary validation messages need to be stored,and the communication overhead is too large.Yao and others propose the authentication mechanism based on multi-branch path,and the scheme that refers to the LBT tree structure will not only support the dynamic updating of individual data blocks,but also support the batch dynamic operation of the data block.However,for large data,it is easy to cause the size of the hash tree built by the server to become larger when the insert operation is too much,and the hash calculation is too many when the root node is calculated.In this paper,PDP and POR,the most representative models in data integrity schemes,and the existing cloud storage integrity verification schemes are introduced.The system models that can support dynamic updates and open validation and the key technologies used are described respectively.It also introduces three classical mechanisms that can support dynamic updating of data.They all have the functions of data insertion,deletion and modification,but they all have their own disadvantages.Finally,to make up for these shortcomings,an improved data integrity disclosure audit scheme based on LBT authentication structure is proposed.First introduces the scheme of improvement,then the system model has made the introduction,then the solution in detail in this paper,the concrete implementation process,and has carried on the proof of correctness and security.Finally,from the aspects of storage cost,communication cost and computing cost,the scheme of this paper is compared with that of Wang et al.,Yao et al.