Research On Data Integrity Verification Scheme Based On Lattice Theory

More and more enterprises and individuals choose to outsource the data of storage and process to the cloud server because of the continuous development of cloud computing.In this way,not only the burden of storage and computing of individuals or organizations can be reduced,but also the data stored in the cloud can be easily accessed anytime and anywhere,and the data stored in the cloud can be shared with other users to achieve the purpose of efficient use of data.However,the cloud storage service is considered to be semi-trusted,which may tamper with or delete data stored by users,and the data privacy and privacy issues caused by this have aroused wide concern.In order to ensure the integrity and accuracy of data,an effective method for verifying data integrity on cloud server should be proposed.Most of the current data integrity verification schemes are based on difficult problems such as large integer decomposition or discrete logarithms over finite fields,they are slow in operation and cannot resist quantum attacks and sub-exponential attacks.In the age of quantum information,it is a trend to propose anti-quantum attack cryptography algorithm,and lattice cryptography is a good choice.The main research of this paper is as follows:(1)A data integrity verification scheme based on homomorphic encryption is proposed.In the scheme,the user first encrypts the data block and then uploads the encrypted data blocks and the original data to the server.During the verification,the user checks whether the data is complete whit the help of a third party auditor.The security of the scheme is based on the difficult problem of Learning With Error.It can not only realize the data integrity verification of the data holder,but also realize the public verification and support the dynamic update of the data.Finally,the safety proof of the scheme is given.It can be seen from the comparison table that the third party calculation amount of the scheme is less and the storage occupation is smaller.(2)A new data integrity verification scheme is proposed on the ideal lattice,which is to sign the data block and upload it to the server.A third party auditor uses the verification algorithm to calculate whether the data is complete.The scheme is designed based on the Ring-Small Integer Solution difficulty problem and proved to be safe under the random predictive model.The scheme supports dynamic operations and satisfies the homomorphism,which can reduce the communication overhead of users,cloud storage servers and trusted third parties,as well as the computing cost of clients.(3)A data integrity verification scheme based on certificateless encryption is proposed.Firstly,the user encrypt data blocks and upload them to the server.Then the trusted third party samples to verify whether the data integrity is destroyed.Finally,the trusted third party feedback the result to the user.The security of the scheme is based on the difficult problem of Learning With Error,which not only supports the dynamic update of data,but also supports public authentication.At the same time,the scheme is proved to be safe under the random prediction model.