Enabling Data Integrity Protection in Regenerating-Coding-Based Cloud Storage

Chen, Henry C. H.; Lee, Patrick P. C.

doi:10.1109/srds.2012.24

Cited by 19 publications

(5 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To improve data availability, Bowers et al [13] proposed a data coding structure achieving the within-server redundancy and cross-server redundancy. Chen et al [14] and Chen et al [17] constructed their remote data checking schemes based on network coding which can save the communication cost of data recovery compared with erasure codes. In particular, [17] considered the crossserver redundancy as [13] in a multiple-server setting, where the cross-server coding was done using network coding instead of erasure codes in [13].…”

Section: Related Workmentioning

confidence: 99%

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Ren

Wang

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Cloud storage allows users to store their data in a remote server to get rid of expensive local storage and management costs and then access data of interest anytime anywhere. A number of solutions have been proposed to tackle the verification of remote data integrity and retrievability in cloud storage systems. Most of existing schemes, however, do not support efficient data dynamics and/or suffer from security vulnerabilities when involving dynamic data operations. In this paper, we propose a dynamic proof of retrievability scheme supporting public auditability and communication-efficient recovery from data corruptions. To this end, we split up the data into data blocks and encode each data block individually using outer code and inner code before outsourcing so that i) an update inside any data block only affects a few codeword symbols and ii) communication-efficient data repair for a breakdown server can be achieved and communication overhead for small data corruptions within a server can be eliminated. Based on the encoded data blocks, we utilize rb23Tree to enforce the data sequence for dynamic operations, preventing the cloud service provider from manipulating data block to pass the integrity check in the dynamic scenario. We also analyze the effectiveness of the proposed construction in defending against pollution attacks during data recovery. Formal security analysis and extensive experimental evaluations are conducted, showing that the proposed scheme is practical for use in cloud storage systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Ren

Wang

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…Unfortunately, the CRC checks can also be manipulated by the malicious nodes, resulting in the failure of the regeneration and reconstruction. In [29], the authors proposed to add data integrity protection in distributed storage. In [30], the authors proposed an erasure-coded distributed storage based on threshold cryptography.…”

Section: Related Workmentioning

confidence: 99%

Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks

Ren

2017

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Regenerating code is a class of code very suitable for distributed storage systems, which can maintain optimal bandwidth and storage space. Two types of important regenerating code have been constructed: the minimum storage regeneration (MSR) code and the minimum bandwidth regeneration (MBR) code.However, in hostile networks where adversaries can compromise storage nodes, the storage capacity of the network can be significantly affected. In this paper, we propose two optimal constructions of regenerating codes through rate-matching that can combat against this kind of adversaries in hostile networks: 2-layer rate-matched regenerating code and m-layer rate-matched regenerating code. For the 2-layer code, we can achieve the optimal storage efficiency for given system requirements. Our comprehensive analysis shows that our code can detect and correct malicious nodes with higher storage efficiency compared to the universally resilient regenerating code which is a straightforward extension of regenerating code with error detection and correction capability. Then we propose the m-layer code by extending the 2-layer code and achieve the optimal error correction efficiency by matching the code rate of each layer's regenerating code. We also demonstrate that the optimized parameter can achieve the maximum storage capacity under the same constraint. Compared to the universally resilient regenerating code, our code can achieve much higher error correction efficiency.

show abstract

“…Our work focuses on single-failure recovery, which accounts for the majority of failures in cloud storage systems [31]. Some studies (e.g., [14], [41]) address the security issues for regenerating-coded data, while the security aspect of FMSR codes is addressed in our prior work [15]. We refer readers to the survey paper [17] for the state-of-the-art research in regenerating codes.…”

Section: Related Workmentioning

confidence: 99%

“…We have some follow-up studies after the conference version [27]. We extend NCCloud to support integrity checking of FMSRcoded data against Byzantine attacks [15]. We also theoretically prove that our two-phase checking can preserve the MDS property of the stored data after iterative repairs [28].…”

Section: Related Workmentioning

confidence: 99%

NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds

Chen

Lee

et al. 2014

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloud vendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost data with the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system for fault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloud failure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storage regenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasure codes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One key design feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, while preserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud and deploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary cost savings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storage operations such as upload/download.

show abstract

Enabling Data Integrity Protection in Regenerating-Coding-Based Cloud Storage

Cited by 19 publications

References 29 publications

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks

NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds

Contact Info

Product

Resources

About