Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

This paper proposes secure regenerating codes that are composed of non-secure regenerating codes and a new all-or-nothing transform. Unlike the previous analysis of secure regenerating codes, the security of the proposed codes is analyzed in the sense of the indistinguishability. The advantage of the proposed codes is that the overhead caused by the security against eavesdropping is much less t...

Regenerating codes are a family of erasure correcting codes that are primarily designed to minimize the amount of data required to be downloaded to repair a failed node in a distributed storage system. In this article, the construction of systematic Minimum Bandwidth Regenerating (MBR) codes based on random network coding, is presented. The repair model considered is the hybrid repair model, wh...

Regenerating codes have been proven a class of optimal distributed storage codes in the tradeoff between storage capacity and repair bandwidth. However, existing regenerating codes rely on expensive computations such as finite field multiplication. The high coding complexity makes regenerating codes unsuitable for practical distributed storage systems. BASIC codes, standing for Binary Addition ...

Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redundancy is by simple replication. This strategy allows an easy and fast access to data, and a good bandwidth efficiency to repair the missing redundancy when a peer leaves or fails in high churn systems. However, it is known that ...

In this paper, we present a construction of (n, k, d,m) secure regenerating codes for distributed storage systems against eavesdroppers that can observe either data stored in at most m storage nodes or downloaded data for repairing at most m failed nodes in a network where m < k ≤ d ≤ n − 1. The (n, k, d,m) secure regenerating code is based on an (n, k, d) minimum bandwidth regenerating (MBR) c...