基于区块链和循环链表多分支路径树的完整性验证  

Integrity verification based on blockchain and circular linked list large branching tree

作　　者：冯天浩 马利民 王佳慧 张伟[1,2] FENG Tianhao;MA Limin;WANG Jiahui;ZHANG Wei(Computer School,Beijing Information Science&Technology University,Beijing 100101,China;Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing,Beijing 100101,China;Ministry of Information and Cyber Security,National Information Center,Beijing 100045,China)

机构地区：[1]北京信息科技大学计算机学院,北京100101 [2]北京未来区块链与隐私计算高精尖创新中心,北京100101 [3]国家信息中心信息与网络安全部,北京100045

出　　处：《北京信息科技大学学报（自然科学版）》2024年第5期88-94,共7页Journal of Beijing Information Science and Technology University（Science and Technology Edition）

基　　金：国家重点研发计划项目(2022YFC3320900);北京市教委科研计划科技一般项目(KM202311232005)。

摘　　要：在对云存储数据进行完整性验证时,传统多分支路径树技术中的多次动态操作会造成树的不平衡状态,导致时间开销大、验证效率低。对此,提出了一种新的完整性验证方法,利用区块链结合循环链表和多分支路径树的数据结构,优化了对不平衡状态下路径树的平衡方法,提升了数据完整性验证效率。实验结果表明,在多次动态操作后链表长度相差较大的情况下,本文方案在验证数据的完整性时平衡多分支路径树所花费的时间相较于对比方案最多可降低71%。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.

关 键 词：云存储 区块链 完整性验证 循环链表 多分支路径树 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]