• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Enabling Efficient Verification of Dynamic Data Possession and Batch Updating in Cloud Storage

Vol. 12, No.6, June 30, 2018
10.3837/tiis.2018.06.001, Download Paper (Free):

Abstract

Dynamic data possession verification is a common requirement in cloud storage systems. After the client outsources its data to the cloud, it needs to not only check the integrity of its data but also verify whether the update is executed correctly. Previous researches have proposed various schemes based on Merkle Hash Tree (MHT) and implemented some initial improvements to prevent the tree imbalance. This paper tries to take one step further: Is there still any problems remained for optimization? In this paper, we study how to raise the efficiency of data dynamics by improving the parts of query and rebalancing, using a new data structure called Rank-Based Merkle AVL Tree (RB-MAT). Furthermore, we fill the gap of verifying multiple update operations at the same time, which is the novel batch updating scheme. The experimental results show that our efficient scheme has better efficiency than those of existing methods.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Yining Qi, Xin Tang and Yongfeng Huang, "Enabling Efficient Verification of Dynamic Data Possession and Batch Updating in Cloud Storage," KSII Transactions on Internet and Information Systems, vol. 12, no. 6, pp. 2429-2449, 2018. DOI: 10.3837/tiis.2018.06.001

[ACM Style]
Qi, Y., Tang, X., and Huang, Y. 2018. Enabling Efficient Verification of Dynamic Data Possession and Batch Updating in Cloud Storage. KSII Transactions on Internet and Information Systems, 12, 6, (2018), 2429-2449. DOI: 10.3837/tiis.2018.06.001