CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Secure Repairable Fountain Codes

Siddhartha Kumar ; Eirik Rosnes ; Alexandre Graell i Amat (Institutionen för signaler och system, Kommunikationssystem)
IEEE Communications Letters (1089-7798). Vol. 20 (2016), 8, p. 1491-1494.
[Artikel, refereegranskad vetenskaplig]

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.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-05-25. Senast ändrad 2016-09-19.
CPL Pubid: 236930

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)