Name
Title | ||
|---|---|---|
Dynamic Provable Data Possession of Multiple Copies in Cloud Storage Based on Full-Node of AVL Tree |
Abstract | ||
|---|---|---|
AbstractThis 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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.4018/IJDCF.2019010110 | Periodicals |
Keywords | Field | DocType |
AVL Tree, Dynamic Operation, Information Security Integrity Verification, Multiple Copies, Provable Data Possession | AVL tree,Computer security,Computer science,Computer network,Possession (law),Cloud storage | Journal |
Volume | Issue | ISSN |
11 | 1 | 1941-6210 |
Citations | PageRank | References |
1 | 0.34 | 6 |
Authors | ||
3 | ||