Remote Data Authentication Scheme Based Balance Binary Sort Merkle Hash Tree

Abstract

Now cloud storage has become the preferred way for users to store large amounts of data. In order to verify the integrity of remote data, Merkle hash tree is often used to generate data fingerprints. Aiming at the shortcomings of existing common schemes for remote data authentication based on Merkle hash tree, in this paper, based on data block index number constructs the balance binary sort Merkle hash tree, and using two-layer data nodes to shorten the authentication path. At the same time, by introducing “virtual nodes” to maintain binary sort Merkle tree balance and simplify insertion; In addition, considering the requirements of sensitive information confidentiality, by group hash for sensitive information and non-sensitive information to ensure that sensitive information is not leaked in the verification process. Theoretical analysis shows that the authentication structure can fulfill the function of data integrity audit well, and support the dynamic operation of data blocks while maintaining the balance of Merkle tree.