一种带权单链表多分支树云数据完整性验证方案  

Cloud Data Integrity Verification Scheme Based on WSLBT

作　　者：朱彧 陈越[1] 严新成 王晓晶 ZHU Yu;CHEN Yue;YAN Xin-cheng;WANG Xiao-jing(Strategic Support Force Information Engineering University,Zhengzhou 450001,China;Subordinate Unit of the Army Staff,Beijing 100042,China)

机构地区：[1]战略支援部队信息工程大学,郑州450001 [2]陆军参谋部附属单位,北京100042

出　　处：《小型微型计算机系统》2020年第3期575-580,共6页Journal of Chinese Computer Systems

基　　金：河南省科技攻关计划基金项目(172102210017)资助.

摘　　要：随着云存储技术的不断发展,越来越多的用户选择将自己的数据存储到云系统中,这节约了用户成本,但同时也使得用户失去了对数据的直接掌控权.数据完整性验证方案可以向用户提供数据完整性证据,但多数支持全动态操作的方案存在计算和带宽开销大的问题.本文对多分支树进行改进,提出了基于带权单链表多分支路径树的云数据完整性验证方案(weighted single linked list large branching tree scheme,WSLBTS).将树的叶节点设置为链表,降低了树的高度,减少了计算和存储开销;引入节点权值以发现多次动态操作后树的不平衡状态并进行再平衡,提高了节点更新效率;引入随机掩码技术,可防止第三方获取数据信息.实验分析证明,本方案支持全动态操作,保护了用户隐私,并且在计算和通信开销上有所改进.With the continuous development of cloud storage technology,more and more clients choose to store their own data in the cloud system,which reduces client’s costs,but also makes clients lose direct control of their data. Data integrity verification schemes can provide data integrity evidence to clients,but most of the schemes supporting full dynamic operation incur much computing and bandwidth overhead. Our paper improves large branching tree( LBT) and proposed a weighted single linked list large branching tree scheme( WSLBTS). This scheme set the leaf nodes of the tree as linked list to reduce the height of the tree and lower the computational and storage overhead. The node weight is introduced to find the unbalanced state of the tree after multiple operations and rebalance it,which improves the efficiency of node updating. The introduction of random mask technology can prevent untrusted third parties from obtaining data information. Finally,our experiment shows that the scheme supports dynamic operation,protects client privacy and reduces computing and communication overhead.

关 键 词：云存储 完整性验证 WSLBT 再平衡机制 全动态操作 

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