Secure Cooperative Regenerating Codes for Distributed Storage Systems
From MaRDI portal
Publication:2986140
DOI10.1109/TIT.2014.2319271zbMATH Open1360.94456arXiv1210.3664OpenAlexW1982157056MaRDI QIDQ2986140FDOQ2986140
Authors: O. Ozan Koyluoglu, A. S. Rawat, Sriram Vishwanath 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Regenerating codes enable trading off repair bandwidth for storage in distributed storage systems (DSS). Due to their distributed nature, these systems are intrinsically susceptible to attacks, and they may also be subject to multiple simultaneous node failures. Cooperative regenerating codes allow bandwidth efficient repair of multiple simultaneous node failures. This paper analyzes storage systems that employ cooperative regenerating codes that are robust to (passive) eavesdroppers. The analysis is divided into two parts, studying both minimum bandwidth and minimum storage cooperative regenerating scenarios. First, the secrecy capacity for minimum bandwidth cooperative regenerating codes is characterized. Second, for minimum storage cooperative regenerating codes, a secure file size upper bound and achievability results are provided. These results establish the secrecy capacity for the minimum storage scenario for certain special cases. In all scenarios, the achievability results correspond to exact repair, and secure file size upper bounds are obtained using min-cut analyses over a suitable secrecy graph representation of DSS. The main achievability argument is based on an appropriate pre-coding of the data to eliminate the information leakage to the eavesdropper.
Full work available at URL: https://arxiv.org/abs/1210.3664
Cited In (4)
This page was built for publication: Secure Cooperative Regenerating Codes for Distributed Storage Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986140)
