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

Survey on securing data storage in the cloud

Cloud Computing has become a well-known primitive nowadays; many researchers and companies are embracing this fascinating technology with feverish haste. In the meantime, security and privacy challenges are brought forward while the number of cloud storage user increases expeditiously. In this work, we conduct an in-depth survey on recent research activities of cloud storage security in association with cloud computing. After an overview of the cloud storage system and its security problem, we focus on the key security requirement triad, i.e., data integrity, data confidentiality, and availability. For each of the three security objectives, we discuss the new unique challenges faced by the cloud storage services, summarize key issues discussed in the current literature, examine, and compare the existing and emerging approaches proposed to meet those new challenges, and point out possible extensions and futuristic research opportunities. The goal of our paper is to provide a state-of-the-art knowledge to new researchers who would like to join this exciting new field

Achieve High Verifiability using Proxy Resignature and TPA in User Revocation within the Cloud

Using Cloud Storage, users can remotely store their data and enjoy the on-demand high quality applications and services from cloud. User can get relaxation from the burden of local data storage and maintenance. In addition, we have an efficient probabilistic query and audit services to improve the performance of approach based on periodic confirmation. So that the users existing blocks by themselves do not need to sign up and download the proxy by using the idea of re-signatures, we block the user revocation on behalf of existing users to the cloud, the signing in again to allow for..In addition, a public Verifier always without retrieving all of the data shared data is able to audit the integrity of Cloud, even if part of the shared data has been signed by the cloud again. Moreover, our system by multiple auditing functions with batch verification audit is able to support. Experimental results show that our system fairly can improve the efficiency of user cancellation. Data storage and sharing services in the cloud, users can easily modify and share data in a group. Shared data to ensure unity in public, group users shared data to calculate signatures on all blocks need to be verified. Shared data by different users in different blocks are usually due to data revisions have been signed by individual users. The proposed system considers proxy resign, if the user from group get revoked. Cloud is able to resign block, which was created previously by the revoked user with existing users private kye. As a result, user revocation can be greatly improved, and capacity of computing and communications resources of existing users can be saved. DOI: 10.17762/ijritcc2321-8169.15062

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