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

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

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
Existing dynamic data possession veri-fication 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.

Cloud storageData integrityProvable data possession (PDP)Data dynamicsCloud computing

QI Yining、TANG Xin、HUANG Yongfeng

展开 >

Department of Electronic Engineering, Tsinghua University, Beijing 100084, China

Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China

This work is supported by the National Key Research and Development Program of ChinaNational Natural Science Foundation of ChinaNational Natural Science Foundation of China

2016YFB0800402U1405254No.U1536207

2019

10.1049/cje.2018.02.007

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(2)
  • 2
  • 17