Font Size: a A A

Research On Cloud Data Integrity Audit Scheme Based On Without Bilinear Pairing

Posted on:2019-04-10Degree:MasterType:Thesis
Country:ChinaCandidate:C H SunFull Text:PDF
GTID:2428330563492471Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
With the rapid development of the Internet,the daily data produced by individuals and enterprises show an explosive growth,traditional computing technology can not meet the data storage needs of individual and enterprise,so they began to outsource growing data to cloud service providers for storage.Although cloud storage has low cost and high performance features,it still faces many security challenges,cloud service providers may maliciously tamper or delete user data out of their own interests.Therefore,scholars have proposed a number of data integrity verification schemes.However,some of these schemes do not support dynamic audit or batch audit,some do not support data privacy protection,some use bilinear pairing whose computation cost is huge.In view of the shortcomings of the existing schemes,this paper aims to study the secure and efficient cloud data integrity audit scheme,which has comprehensive audit function.(1)A Merkle-Hash-Tree based without bilinear pairing audit(MHT-WiBPA)scheme is proposed.The scheme is based on the three party system model,and combines the Merkle hash tree to verify the integrity of the file data blocks,it can effectively support single audit,dynamic audit and batch audit.Through detailed security analysis,it is proved that the MHT-WiBPA scheme satisfies the storage correctness,supports data privacy protection,and can resist forgery attack,replay attack and replacement attack from the cloud server.The MHT-WiBPA scheme uses without bilinear pairing instead of bilinear pairing to improve the efficiency of audit.The detailed performance analysis and experimental analysis of the MHT-WiBPA and MHT schemes in single audit,dynamic audit and batch audit are carried out in detail.The results show that the MHT-WiBPA scheme has lower computation cost and higher audit efficiency than the MHT scheme.(2)In view of the problems in the MHT-WiBPA scheme,a Index-Switch-Table based without bilinear pairing audit(IB-WiBPA)scheme is proposed.The scheme uses a more concise index switch table to record the audit information of the data blocks,reducingunnecessary overhead,and can effectively support audit,dynamic audit and batch audit.Through detailed security analysis,it is proved that the IB-WiBPA scheme satisfies the storage correctness,supports data privacy protection,and can resist forgery attack,replay attack and replacement attack from the cloud server.The detailed performance analysis and experimental analysis of the IB-WiBPA and MHT-WiBPA schemes in single audit,dynamic audit and batch audit are carried out in detail.The results show that the IB-WiBPA scheme has a higher audit efficiency than the MHT-WiBPA scheme in single audit scheme and dynamic audit scheme,and the overall calculation cost is close to the MHT-WiBPA scheme in batch audit scheme.
Keywords/Search Tags:cloud storage, integrity audit, without bilinear pairing, dynamic audit, Index-Switch-Table
PDF Full Text Request
Related items