Research On Authenticated Data Structures Of Provable Data Possession In Cloud Computing

In public cloud，storage devices are not within the control of enterprises or individualswhich will not allow enterprises and individuals fully ensuring the security of the data storedin the cloud. Remote data integrity verification research is a research on solving this issue.Without having their data in the local storage,this study allows enterprises and individualsverifying the integrity of the data stored in the cloud through some specific protocols.This paper introduces two classic protocols PDP and DPDP in this research area. Weanalyzes the problems caused by the dynamic data operation, and describes the currentcommonly used authentication data structure——Merkle Hash Tree. We offer a briefanalysis of its performance.1)We proposed a new authentication data structures-Certification Binary Tree. It hasbetter performance than Merkle Hash Tree.2)We describe the construction of Certification Binary Tree,certificationprocess,generation of prove path and the process of d ynamic data operation include modify,insert, and delete.3)We implemente Certification Binary Tree and Merkle Hash Tree. Compare theirefficiency both in single dynamic data operations and batch-update operations. Inaddition,we also compare the efficiency between single dynamic data operations andbatch-update operations.Compare to Merkle Hash Tree,our data structure reduces the additional storage spacefrom O(2n-1) down to O(n), and has better performance in single dynamic data operations.The improvement of efficiency in batch-update operations is between0.22to1times basedon updated block number.