Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.