Secure regenerating code

Distributed storage plays a crucial role in the current cloud computing framework. After the theoretical bound for distributed storage was derived by the pioneer work of the regenerating code, Reed-Solomon code based regenerating codes, including the minimum storage regeneration (MSR) code and the minimum bandwidth regeneration (MBR) code, were developed. However, in the hostile network with passive eavesdroppers and active attackers, the data confidentiality and storage capacity of the network can be significantly affected. In this paper, we propose a secure MSR code that can combat against the passive eavesdroppers and active attackers in the network. We also provide theoretical analyses showing that our code can provide better security with less computational cost and bandwidth overhead.