Dynamic Attribute Tree for the Data Encryption and Third Party Auditing for Cloud Storage

Background: To reduce the burden of the users to perform cloud audits. The tree based key handling method provides the structure format of data and increases performance in the search process. Methods: The Dynamic Attribute Tree method is proposed for Third-Party auditing to encrypt the data based on its attribute. The attributes are stored in tree structure along with data and key that helps to effectively improve the dynamic update of the data in the cloud. Findings: The proposed Dynamic Attribute Tree method has 6.7milliseconds computation time for 100 blocks of data and the existing Merkel Tree method has 7.5milliseconds computation time. Novelty: The Novelty of the project is the Dynamic Attribute Tree method uses bilinear mapping to verify the integrity of the data without retrieving the actual data from the cloud. Keywords: Bilinear Mapping; Cloud audit; Cloud storage services; Dynamic Attribute Tree; and Third Party Auditing