Enabling Efficient Batch Updating Verification for Multi-versioned Data in Cloud Storage

被引:0
作者
QI Yining [1 ,2 ]
TANG Xin [1 ,2 ]
HUANG Yongfeng [1 ,2 ]
机构
[1] Department of Electronic Engineering, Tsinghua University
[2] Tsinghua National Laboratory for Information Science and Technology
关键词
Cloud storage; Data integrity; Provable data possession(PDP); Data dynamics; Cloud computing;
D O I
暂无
中图分类号
TP333 [存贮器];
学科分类号
081201 ;
摘要
Existing dynamic data possession verification schemes not only suffer from low efficiency of rebalancing its Merkle Hash tree(MHT) when executing data updating, but also lack effective mechanism to verify multi-version files. Aiming at these problems, this paper propose a new data structure called Rank-based multi-version Merkle AVL tree(RBMV-MAT) to achieve efficient batch updating verification for multi-version data.RBMV-MAT uses a special lock and relaxed balance to decrease the frequency of rebalacing operations. The experimental results show that our efficient scheme has better efficiency than those of existing methods.
引用
收藏
页码:377 / 385
页数:9
相关论文
共 4 条
[1]   Dynamic Provable Data Possession [J].
Erway, C. Chris ;
Kupcu, Alptekin ;
Papamanthou, Charalampos ;
Tamassia, Roberto .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2015, 17 (04)
[2]   Compact Proofs of Retrievability [J].
Shacham, Hovav ;
Waters, Brent .
JOURNAL OF CRYPTOLOGY, 2013, 26 (03) :442-483
[3]   The Complexity of Online Memory Checking [J].
Naor, Moni ;
Rothblum, Guy N. .
JOURNAL OF THE ACM, 2009, 56 (01)
[4]  
A generalization of AVL trees[J] . Caxton C. Foster.Communications of the ACM . 1973 (8)