Secret sharing schemes based on minimum bandwidth regenerating codes

In this paper, we propose a construction of secure regenerating codes for distributed storage systems against passive eavesdroppers that can observe either data stored in storage nodes or downloaded data for repairing failed nodes in a network, and evaluate the security of them. The proposed secure regenerating code is based on a minimum bandwidth regenerating(MBR) code, which was proposed by Rashmi, Shah and Kumar as optimal exact-regenerating codes. The proposed secure regenerating code has the security of a ramp secret sharing scheme.