The Dynamic Data Integrity Verification and Recovery Scheme based on MHT

The dynamic data integrity verification and recovery scheme based on MHT (Merkle Hashing Tree) is proposed to solve the problems of high communication overhead and dynamic data validation in the process of storing data integrity verification on cloud servers. It constructs a late-model layering authentication data structure, and organizes each replica block of a data block into a replica sub-tree to reduce the communication overhead of multiple copies update verification greatly. The authentication of server security index information is merged into data validation to avoid server attacks. Finally, the data can be recovered through binary chop and Shamir secret sharing mechanism when data corruption is found. The experimental results show that this scheme can not only reduce computing and communication overhead effectively, but also supports the dynamic operation of data well.