2,780 research outputs found
Secure Repairable Fountain Codes
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.Comment: To appear in IEEE Communications Letter
Weakly Secure Regenerating Codes for Distributed Storage
We consider the problem of secure distributed data storage under the paradigm
of \emph{weak security}, in which no \emph{meaningful information} is leaked to
the eavesdropper. More specifically, the eavesdropper cannot get any
information about any individual message file or a small group of files. The
key benefit of the weak security paradigm is that it incurs no loss in the
storage capacity, which makes it practically appealing.
In this paper, we present a coding scheme, using a coset coding based outer
code and a Product-Matrix Minimum Bandwidth Regenerating code (proposed by
Rashmi et al.) as an inner code, that achieves weak security when the
eavesdropper can observe any single storage node. We show that the proposed
construction has good security properties and requires small finite field size.Comment: Extended version of the paper accepted in NetCod 201
- …