Dynamic-Hash-Table Based Public Auditing for Secure Cloud Storage (Oct-2017)
The main aim of the project is to increase efficient security for Public auditing secure cloud storage because users may not fully trust the cloud service providers (CSPs) in that it is difficult to determine whether the CSPs meet their legal expectations for data security. Differing from the existing works, so we are introduced the proposed scheme migrates the authorized information from the CSP to the TPA.
In this work, we concentrate on the design of an effective public auditing scheme based on the DHT illustrated , which involves the following three entities: User, who stores a great quantity of data files in the cloud, can be an individual or a organization; Cloud Service Provider (CSP), who manages and coordinates a number of cloud. Servers to offer scalable and on‐demand outsourcing data services for users; and Third Party Auditor (TPA), who can verify the reliability of the cloud storage services (CSS) credibly and dependably on behalf of the users upon request. Users can be relieved of the burden of storage and computation while enjoying the storage and maintenance service by outsourcing their data into the CSP. However, due to the loss of local possession of the data, they are keen to ensure the correctness and integrity of their data periodically. To obtain a convincing answer as well as alleviate the usersʹ burden potentially induced by the frequent verification, the TPA is involved to check the integrity of the usersʹ data stored in the cloud. However, in the whole verification process, the TPA is not expected to be able to learn the actual content of the usersʹ data for privacy protection. to enhance the efficiency and enable the scalability of public auditing, the TPA should deal with multiple auditing tasks from various users in a fast and cost‐efficient manner, i.e., support the batching auditing. First presented the public auditing scheme, in which the checking work is customarily done by an authorized third party auditor (TPA). Compared with the former, the latter can offer dependable auditing results and significantly reduce usersʹ unnecessary burden by introducing an independent TPA. Thus, it is more rational and practical, and popularly believed to be the right direction of future development. Therefore, it is critical and significant to develop efficient auditing techniques to strengthen data ownersʹ trust and confidence in cloud storage, of which the core is how to effectively check data integrity remotely. proposed another public auditing scheme (IHT‐PA) based on an index‐hash table (IHT), which can effectively reduce both the computational costs and communication overhead by storing the data properties for auditing using the IHT in the TPA instead of the CSP. The IHT is the key of IHT‐PA to support data dynamics, but it is inefficient in updating operations, especially insertion and deletion operations. The main reason is that these updating operations will lead to the adjustment of average N/2 elements, where N is the total number of all blocks, due to the sequence structure of the IHT. Moreover, the operations would change the sequence numbers of some blocks, and cause the recalculations of their tags, which would induce extra computational costs to the user and unnecessary communication overhead.