The Usage Of The Proposed System

Published Date: 02 Nov 2017

ABSTRACT:

Cloud Computing has been intended as the future-generation technology of an IT Enterprise. It moves the application software and databases to the centralized vast data centers, but the security and management of data and services that are provided are less trustworthy.. This unique paradigm brings about many new security challenges, which have not been well understood. This paper go through 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 check the integrity of the dynamic data stored in the cloud. The introduction of TPA prevents the involvement of the client through the verification of whether his data stored in the cloud is indeed intact, which can be important 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 latter works on ensuring remote data integrity often lacks the support of either public verification or dynamic data operations, this study achieves both of them. 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 the seamless integration of these two salient features in our protocol design. In particular, to achieve efficient data dynamics, we improve the existing proof of storage models by manipulating the classic MerkleHash Tree construction for block tag authentication.To support efficient handling of multiple auditing tasks, we further explore the technique of bilinear aggregate signature to extend our

main result into a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. Extensive security and performance analysis show that the proposed schemes are highly efficient and provably secure.

INTRODUCTION:

Several trends are opening up the era of Cloud Computing, which is an Internet-based development and use of computer technology. The ever cheaper and more powerful processors, together with the "software as a service" (SaaS) computing architecture, are transforming data centers into pools of computing service on a huge

scale. Due to increase in network bandwidth and reliable yet flexible network connections make it even possible that clients can now subscribe high quality services from data and software that reside solely on remote data centers.

Although envisioned as a promising service platform for the Internet, this new data storage paradigm in "Cloud" brings about many challenging design issues which have profound influence on the security and performance of the overall system. One of the biggest concerns with cloud data storage is that of data integrity verification at untrusted servers. For example, the storage service provider, which experiences Byzantine failures occasionally, may decide to hide the data errors from the clients for the benefit of their own. More serious is that for saving money and storage space the service provider might neglect to keep or deliberately delete rarely accessed data files which belong to an ordinary client. Consider the large size of the outsourced electronic data and the client’s constrained resource capability, the core of the problem can be generalized as how can the client find an efficient way to perform periodical integrity verifications without the local copy

of data files. In order to solve the problem of data integrity checking, many schemes are proposed under different systems and security models In all these works, great efforts are made to design solutions that meet various requirements: high scheme efficiency, stateless verification, unbounded use of queries and retrievability of data.Considering the role of the verifier in the model, all the schemes presented before fall into two categories: private verification and public verfication. Although schemes with private verification can achieve higher scheme efficiency, public verification allows anyone, not just the client (data owner), to challenge the cloud server for correctness of data storage while keeping no private information. Then, clients are able to delegate the evaluation to an third party auditor(TPA). In the cloud, the clients themselves are unreliable so for practical use, it seems more rational to equip the verification protocol with public auditability, which is expected to play a more important role in achieving economies of scale for Cloud Computing. Moreover, for efficiency consideration, the outsourced data themselves should not be required by the verifier for the verification purpose. Another major concern among previous designs is that of supporting dynamic data operation for cloud data storage applications. In Cloud Computing, the remotely stored electronic data might not only be accessed but also updated by the clients, e.g., through block modification, deletion and insertion Moreover, , the explicit extension of the present provable data possession (PDP) schemes to support data dynamics may lead to security loopholes. Although there are many difficulties faced by researchers, it is well believed that supporting dynamic data operation can be of vital importance to the practical application of storage outsourcing services.

This work does following actions:

It allows the public auditing/verification system of data storage security in Cloud Computing, and propose a protocol for fully dynamic data operations like block insertion and deletion etc. which are missing in most existing schemes.

We extend our system to support scalable and efficient public auditing/verification in Cloud Computing. In particular our scheme achieves batch verification where multiple handover or delegated verification tasks from different users can be performed at a time by the TPA.

We prove the security of our proposed scheme construction and justify the performance of our scheme through implementation.

In the existing system and from the perspective of data security, which has always been an important aspect of quality of service, Cloud Computing inevitably poses new challenging security threats for number of reasons.

1. Firstly , conventional cryptographic primitives for the purpose of data security protection cannot be directly adopted due to the users’ loss control of data under Cloud Computing. Therefore, verification of correct data storage in the cloud must be conducted without explicit knowledge of the whole data. Considering various kinds of data and information for each user stored in the cloud and the demand of long term continuous assurance of their data safety, the problem of verifying correctness of data storage in the cloud becomes even more challenging.

2. Secondly, Cloud Computing is not just a third party data warehouse. The data stored in the cloud may quite often upgraded by the users, including deletion,insertion, modification, reordering ,appending, etc. To ensure storage correctness under dynamic data update has a paramount (more) importance.

And the disadvantages of the existing system is that techniques, while can be useful to ensure the storage correctness without having users possessing data, cannot locate all the security issues in cloud data storage, since they are all focusing on mono server scenario and all of them doesn’t consider dynamic data operations. As an complementary approach, researchers have also proposed several distributed protocols for ensuring storage correctness across multi servers or peers. Again, none of these distributed schemes is aware of dynamic data operations. As a result, their applicability in cloud data storage can be formidably constrainted.

We propose an effective and flexible distributed scheme with explicit dynamic data support to ensure the correctness of user data in the cloud. We rely on erasure correcting code in the file distribution preparation to provide duplications and guarantee the data dependability service. This scheme greatly reduces the communication and storage burden as compared to the conventional replication-based file distribution techniques. By make use of the homomorphic tokens with distributed verification of erasure-coded data, our scheme achieves the storage correctness insurance as well as data error localization: whenever data detected as a corrupted one during the storage correctness verification, our paradigm can guarantee the automatic localization of data errors, by the identification of the misbehaving server(s).

And the advantages by the usage of the proposed system is as follows:

1. As compared to many of its predecessors, which only provide binary output about the storage state across the distributed servers, the challenge-response protocol in our work further provides the localization of data errors and identification of misbehaving servers also.

2.Notlike as most latter works for ensuring remote data integrity, the new paradigm supports secured and efficient dynamic operations on data blocks, including: update, delete and append.

3. Extensive security and performance analysis shows that the proposed paradigm is highly efficient against Byzantine failures, malicious data modification attack, and even server colliding assaults.