Secure Repairable Fountain Codes

TL;DR

This paper introduces secure repairable fountain codes for distributed storage that ensure information-theoretic security against eavesdroppers, using a combination of Gabidulin codes and RFCs to enhance data protection and repair efficiency.

Contribution

It presents a novel construction of secure RFCs that integrate Gabidulin codes, improving security and repairability in distributed storage systems.

Findings

Achieves information-theoretic security against eavesdroppers.

Provides code rate comparisons with existing secure codes.

Demonstrates effective secure data repair in distributed systems.

Abstract

In this letter, we provide the construction of repairable fountain codes (RFCs) for distributed storage systems that are information-theoretically secure against an eavesdropper that has access to the data stored in a subset of the storage nodes and the data downloaded to repair an additional subset of storage nodes. The security is achieved by adding random symbols to the message, which is then encoded by the concatenation of a Gabidulin code and an RFC. We compare the achievable code rates of the proposed codes with those of secure minimum storage regenerating codes and secure locally repairable codes.