Enabling Public Verifiability and Data Dynamics for Storage Security

Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. This unique paradigm brings about many new security challenges, which have not been well understood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. In particular, we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of client through the auditing of whether his data stored in the cloud is indeed intact, which can be important in achieving economies of scale for Cloud Computing. The support for data dynamics via the most general forms of data operation, such as block modification, insertion and deletion, is also a significant step toward practicality, since services in Cloud Computing are not limited to archive or backup data only. While prior works on ensuring remote data integrity often lacks the support of either public verifiability or dynamic data operations, this paper achieves both. We first identify the difficulties and potential security problems of direct extensions with fully dynamic data updates from prior works and then show how to construct an elegant verification scheme for seamless integration of these two salient features in our protocol design. In particular, to achieve efficient data dynamics, we improve the Proof of Retrievability model \cite{Shacham:ASIACRYPT:2008} by manipulating the classic Merkle Hash Tree (MHT) construction for block tag authentication. Extensive security and performance analysis show that the proposed scheme is highly efficient and provably secure

Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing

Distributed computing has been emerged as a key element in engineering of IT Enterprise. In distributed computing environment it is mandatory to place necessary databases and their corresponding application programming in the unified vast server farms, where the information and administrations may not be completely reliable. This involves numerous new security challenges, which are unpredictable. This paper focuses on guaranteeing the reliability of information stockpiling in Cloud Computing environment. The third party administrator in collaboration with the customer ensures whether his information dispensed in the proper place in the cloud, which can be critical in accomplishing economies of scale for Cloud Computing. The help for information progression by means of the broadest types of information operation, for example, piece adjustment, inclusion and erasure is additionally a huge advance toward common sense, since administrations in Cloud Computing are not restricted to file or reinforcement information as it were. We initially recognize the challenges and potential security issues of direct expansions with completely powerful information refreshes from earlier works and after that demonstrate to develop an exquisite confirmation conspire for the consistent mix of these two notable highlights in our convention plan. Specifically, to accomplish proficient information progression, we enhance the current evidence of capacity models by controlling the exemplary Merkle Hash Tree development for square label confirmation

Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy

Cloud storage services have become accessible and used by everyone. Nevertheless, stored data are dependable on the behavior of the cloud servers, and losses and damages often occur. One solution is to regularly audit the cloud servers in order to check the integrity of the stored data. The Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy presented in ACISP'15 is a straightforward design of such solution. However, this scheme is threatened by several attacks. In this paper, we carefully recall the definition of this scheme as well as explain how its security is dramatically menaced. Moreover, we proposed two new constructions for Dynamic Provable Data Possession scheme with Public Verifiability and Data Privacy based on the scheme presented in ACISP'15, one using Index Hash Tables and one based on Merkle Hash Trees. We show that the two schemes are secure and privacy-preserving in the random oracle model.Comment: ISPEC 201

Dynamic and Public Evaluation Using Accurate Cloud Data in Imbalance

Customers of cloud services lose control over their data, making it more difficult to ensure its safety. New methods such as "provable data ownership" and "proofs of irretrievability" have been created as a solution to this problem; however, they are designed to audit static archive material and hence do not take data dynamics into consideration. As an added complication, the threat models used by these schemes often assume the data owner to be trustworthy and focus on identifying a hostile cloud service provider, even if the latter might be the source of any harmful action. Thus, there should be a public auditing mechanism that takes data dynamics into account and uses fair means to settle disputes. Specifically, we develop an index switcher to effectively handle data dynamics by doing away with the limitation of index use in tag computation imposed by conventional methods. We create new extensions to existing threat models and use the signature exchange idea to design fair arbitration mechanisms for resolving future disputes, all with the goal of ensuring that no one may participate in unfair activity without being discovered. Our approach seems secure, according to the security analysis, and the performance evaluation indicates that the extra work required for data dynamics and conflict resolution is not insurmountable