Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

TL;DR

This paper explores the trade-offs between resilience, security, and local-repairability in distributed storage systems, proposing optimal coding schemes that enhance security against eavesdroppers while enabling efficient local repairs.

Contribution

It introduces new bounds and constructions for secure, locally repairable codes, advancing the understanding of secure distributed storage system design.

Findings

Improved secrecy capacity bounds for minimum storage regenerating codes.

Secure coding schemes that achieve these bounds in specific cases.

New bounds on minimum distance for locally repairable codes.

Abstract

This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSS). 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 stored information. Second, the 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: a. An improved bound on the secrecy capacity for minimum storage regenerating codes, b. secure coding schemes that achieve the bound for some special cases, c. a new bound on minimum distance for locally repairable codes, d. code construction for locally repairable codes that attain the minimum distance bound, and e. repair-bandwidth-efficient locally repairable codes with and without security constraints.