Secure regenerating codes using linear MBR/MSR codes and the all-or-nothing transform

This paper proposes new secure regenerating codes that combine non-secure regenerating codes with an 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 storage-size overhead is much less than that of previous secure regenerating codes.