Integrity verification based on blockchain and circular linked list large branching tree
When performing integrity verification on data in cloud storage,multiple dynamic operations in the traditional large branching tree technology will cause the imbalance state of the tree,resulting in high time overhead and low verification efficiency.In this regard,a new integrity verification method was proposed by using the blockchain combined with the data structure of circular linked list and large branching tree,which optimized the balance method of the path tree in the imbalanced state and improved the efficiency of data integrity verification.Experimental results show that,compared with the comparison scheme,the time to balance the large branching tree when verifying the data integrity spent by this scheme is reduced by up to 71％when there is a significant difference in the length of the link list after multiple dynamic operations.
cloud storageblockchainintegrity verificationcircular linked listlarge branching tree
万方数据
维普
