Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSSs). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, secu...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2014-01, Vol.60 (1), p.212-236
Main Authors: Rawat, Ankit Singh, Koyluoglu, Onur Ozan, Silberstein, Natalia, Vishwanath, Sriram
Format: Article
Language:English
Subjects:
Applied sciences
Bandwidth
Coding for distributed storage systems
Coding, codes
Decision support systems
Encoding
Exact sciences and technology
Information theory
Information, signal and communications theory
locally repairable codes
Maintenance engineering
repair bandwidth efficient codes
Resilience
Secret
Security
Signal and communications theory
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSSs). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, security, and local-repairability in these systems. In particular, this paper first investigates security in the presence of colluding eavesdroppers, where eavesdroppers are assumed to work together in decoding the stored information. Second, this paper focuses on coding schemes that enable optimal local repairs. It further brings these two concepts together to develop locally repairable coding schemes for DSS that are secure against eavesdroppers. The main results of this paper include: 1) an improved bound on the secrecy capacity for minimum storage regenerating codes; 2) secure coding schemes that achieve the bound for some special cases; 3) a new bound on minimum distance for locally repairable codes; 4) code construction for locally repairable codes that attain the minimum distance bound; and 5) repair-bandwidth-efficient locally repairable codes with and without security constraints.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2288784