Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree

Min Long, You Li, Fei Peng

Source Title: International Journal of Digital Crime and Forensics (IJDCF)11(1)

ISSN: 1941-6210|EISSN: 1941-6229|EISBN13: 9781522565147|DOI: 10.4018/IJDCF.2019010110

MLA

Long, Min, et al. "Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree." IJDCF vol.11, no.1 2019: pp.126-137. http://doi.org/10.4018/IJDCF.2019010110

APA

Long, M., Li, Y., & Peng, F. (2019). Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree. International Journal of Digital Crime and Forensics (IJDCF), 11(1), 126-137. http://doi.org/10.4018/IJDCF.2019010110

Chicago

Long, Min, You Li, and Fei Peng. "Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree," International Journal of Digital Crime and Forensics (IJDCF) 11, no.1: 126-137. http://doi.org/10.4018/IJDCF.2019010110

Export Reference

Favorite Full-Issue Download

View Full Text HTML

View Full Text PDF

Abstract

This article describes how to protect the security of cloud storage, a provable data possession scheme based on full-nodes of an AVL tree for multiple data copies in cloud storage. In the proposed scheme, a Henon chaotic map is first implemented for the node calculation of the AVL tree, and then the location of the data in the cloud is verified by AVL tree. As an AVL tree can keep the balance even with multiple dynamic operations made on the data in the cloud, it can improve the search efficiency of the data block, and reduce the length of the authentication path. Simulation results and analysis confirm that it can achieve good security and high efficiency.