Research On Data Integrity Verification Algorithm In Mobile Cloud Storage

Mobile cloud data-sharing services provide mobile users with convenient data access.However,data integrity issues are often faced with data loss or corruption due to remote outsourcing of data stored in the cloud service storage space,making data integrity verification a principal technical means to address the issue.However,existing data integrity algorithms do not consider the device defects of mobile users,making it possible for the verification to fail or be maliciously exploited by cloud service providers to hide their corrupted data.Moreover,the verification results obtained after data integrity verification face the problem of how to be reliably shared to avoid repeated verification for each mobile user separately and reduce mobile users’ limited resource consumption.To this end,this paper investigates the data integrity verification algorithm in mobile cloud storage,and the main work is as follows.To solve the time limit problem of verification and thus improve the success rate of data integrity verification,this paper proposes a data integrity verification algorithm based on the challenge time limit.The algorithm analyzes the time overhead of each key step in the data integrity verification process to establish the challenge time limit and ensure the timeliness of the verification.In addition,Moreover,0/1 coding,range proof,and commitment techniques are used to the challenge deadline for privacy protection and tamper-proof.The successful execution of data integrity validation is guaranteed under the constraint of the challenge deadline.To solve the problem of sharing the verification results and thus expand the utility of data integrity verification,this paper proposes a reliable sharing method of data integrity verification results.The algorithm uses the PDP scheme to verify the data integrity and obtain the corresponding verification results,and then the polynomial technique stores the verification results reliably.Based on the combination of the polynomial commitment technique,the reliability sharing of the verification results is achieved.Finally,the theoretical analysis and experimental results show that this paper’s data integrity verification algorithm based on challenge deadline protects the privacy of the challenge deadline and key time nodes and controls the verification process to ensure the smooth execution of verification with low verification overhead.This paper’s reliable sharing method of data integrity verification results achieves polynomial storage of data integrity verification results,which reduces the duplicate verification overhead brought by the traditional verification results storage method,and at the same time,achieves reliable sharing of verification results with low overhead.