Correcting adversarial errors with generalized regenerating codes

Traditional regenerating codes are efficient tools to optimize both storage and repair bandwidth in storing data across a distributed storage system, particularly in comparison to erasure codes and data replication. In traditional regenerating codes, the collection of any \begin{document}$ k $\end{document} nodes can reconstruct all stored information and is called the reconstruction set, \begin{document}$ \aleph _R $\end{document} . A failed node can be regenerated from any \begin{document}$ d $\end{document} surviving nodes. These collections of \begin{document}$ d $\end{document} nodes are called the regeneration sets, \begin{document}$ \aleph _H $\end{document} . The number of reconstruction sets and the number of regeneration sets satisfy \begin{document}$ |\aleph _R| = C_n^k $\end{document} and \begin{document}$ |\aleph _H| = C_{n-1}^d $\end{document} . In generalized regenerating codes, we will have, \begin{document}$ 1\le|\aleph_R|\le C^k_n $\end{document} and \begin{document}$ 1\le|\aleph_H|\le C_{n-1}^d $\end{document} . In this paper, we address the problem of secure generalized regenerating codes and present a coding scheme by focusing on the features of the generalized regenerating codes that protects data in the distributed storage system in presence of an active omniscient adversary. This adversary can maliciously alter the data stored on the nodes under its control and send erroneous outgoing message when contacted for the repair of failed nodes. In our scheme notwithstanding the presence of an adversary in distributed storage system, a data collector can still obtain the original file using a classical minimum distance decoder.