Information-theoretically Secure Regenerating Codes for Distributed Storage

TL;DR

This paper introduces explicit constructions of regenerating codes that ensure information-theoretic security in distributed storage, protecting against eavesdroppers with access to stored data and repair downloads.

Contribution

It presents novel secure regenerating code constructions that achieve the secrecy capacity under a specified threat model.

Findings

Codes achieve information-theoretic secrecy capacity

Explicit constructions provided for secure data storage

Enhance security in distributed storage systems

Abstract

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security. In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes. We provide explicit constructions of regenerating codes that achieve information-theoretic secrecy capacity in this setting.