Concepedia

Publication | Closed Access

Ensuring data storage security in Cloud Computing

769

Citations

17

References

2009

Year

TLDR

Cloud computing shifts application software and databases to large data centers, creating new security challenges that are not fully understood and making data storage security a critical quality‑of‑service concern. The authors aim to guarantee users' data correctness in the cloud by proposing an effective, flexible distributed scheme. Their scheme employs homomorphic tokens with distributed verification of erasure‑coded data to provide storage‑correctness insurance, localize misbehaving servers, and support secure, efficient dynamic operations such as updates, deletions, and appends. Security and performance analysis demonstrates that the scheme is highly efficient and resilient against Byzantine failures, malicious data‑modification attacks, and server‑collusion attacks.

Abstract

Cloud computing has been envisioned as the next-generation architecture of IT enterprise. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, cloud computing moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this article, we focus on cloud data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in the cloud, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server (s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server colluding attacks.

References

YearCitations

Page 1