Published in

Springer Verlag, Lecture Notes in Computer Science, p. 355-370

DOI: 10.1007/978-3-642-04444-1_22

Links

Tools

Export citation

Search in Google Scholar

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

Proceedings article published in 2009 by Qian Wang ORCID, Cong Wang ORCID, Jin Li, Kui Ren, Wenjing Lou
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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 un- derstood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. In particular, we consider the task of allow- ing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. The introduc- tion of TPA eliminates the involvement of client through the auditing of whether his data stored in the cloud is indeed intact, which can be impor- tant 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 to- ward 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 el- egant 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 (1) by manip- ulating 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.