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.

[1]  Yutaka Miyake,et al.  Securing distributed storage systems based on arbitrary regenerating codes , 2013 .

[2]  Hidenori Kuwakado,et al.  Generalization of Rashmi-Shah-Kumar Minimum-Storage-Regenerating Codes , 2013, ArXiv.

[3]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  Wei-Ho Chung,et al.  An unified form of exact-MSR codes via product-matrix framework , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[5]  Ronald L. Rivest,et al.  All-or-Nothing Encryption and the Package Transform , 1997, FSE.

[6]  Kannan Ramchandran,et al.  On secure distributed data storage under repair dynamics , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Chau Yuen,et al.  On block security of regenerating codes at the MBR point for distributed storage systems , 2014, 2014 IEEE International Symposium on Information Theory.

[8]  Anand Desai,et al.  The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search , 2000, CRYPTO.

[9]  Hidenori Kuwakado,et al.  Secure Regenerating Codes Based on Rashmi-Shah-Kumar MBR Codes , 2013, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Nihar B. Shah,et al.  Information-Theoretically Secure Regenerating Codes for Distributed Storage , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[11]  Kannan Ramchandran,et al.  Exact Regenerating Codes for Distributed Storage , 2009, ArXiv.

[12]  Kannan Ramchandran,et al.  Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.