摘要
云存储中数据完整性验证的主要思想是利用树形或类树形数据结构来存储用户外包的数据,并将该数据结构与适当的密码学技术结合使其具备可认证性,即认证字典。该文将基于结点大小平衡树(size balanced tree,SBT)结构来构建认证字典,并在该认证字典基础上设计出数据完整性验证方案。基于SBT结构的数据完整性验证方案能更好地支持动态数据集的完整性验证,避免了数据更新引起的周期性重构。实验结果表明,相对于基于AVL树、Treap的认证结构,基于SBT结构的认证字典具备更好的平衡性和更高的数据操作效率。
Data integrity verification in cloud storage mainly uses tree or quasi-tree data structure to store outsourced data, and combines such data structure with appropriate cryptographic techniques to make it authenticated, which is named as authenticated dictionary. This paper designs a new authenticated dictionary based on the size balanced tree and proposes a new data integrity verification scheme based on the new authenticated dictionary. The new scheme supports integrity verification for dynamic data set and avoids periodic reconstruction of authenticated dictionary which can be caused by update operations. Experimental results show that the authenticated dictionary based on SBT has better balance and higher efficiency of data operation than the ones based on AVL tree and Treap.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2014年第6期929-933,共5页
Journal of University of Electronic Science and Technology of China
基金
青年科学基金(61103205)
中国移动科研基金(2012 MCM20121041)
广东省产学研重点项目(2012B091000054)
关键词
云存储
数据安全
完整性验证
结点大小平衡树
cloud storage
data security
integrity verification
size balanced tree