Secure Repairable Fountain Codes
Artikel i vetenskaplig tidskrift, 2016

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.

Författare

Siddhartha Kumar

Simula Research Laboratory

Universitetet i Bergen

Eirik Rosnes

Simula Research Laboratory

Universitetet i Bergen

Alexandre Graell i Amat

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

IEEE Communications Letters

1089-7798 (ISSN)

Vol. 20 8 1491-1494

Komprimerad avkänning med hjälp av kodningsteori

Vetenskapsrådet (VR), 2012-01-01 -- 2015-12-31.

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Kommunikationssystem

Elektroteknik och elektronik

DOI

10.1109/LCOMM.2016.2574355