Secure Regenerating Codes Using Linear Regenerating Codes and the All-or-Nothing Transform

This paper proposes secure regenerating codes that are composed of non-secure regenerating codes and a new 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 overhead caused by the security against eavesdropping is much less than that of previous secure regenerating codes. The security of the proposed codes against eavesdropping mainly depends on the new all-or-nothing transform. key words: regenerating code, secure regenerating code, all-or-nothing transform, indistinguishability

[1]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[3]  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.

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

[5]  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).

[6]  Nihar B. Shah,et al.  Optimality of the product-matrix construction for secure MSR regenerating codes , 2014, 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP).

[7]  Hidenori Kuwakado,et al.  Secure Regenerating Codes Based on MSR Codes for Distributed Storage Systems , 2013 .

[8]  Ming Xian,et al.  Characterization of Secrecy Capacity for General MSR Codes under Passive Eavesdropping Model , 2015, ArXiv.

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

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

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

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

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

[14]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

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

[16]  Krishna R. Narayanan,et al.  Weakly Secure Network Coding , 2005 .

[17]  Jon Feldman,et al.  On the Capacity of Secure Network Coding , 2004 .

[18]  Frank R. Kschischang,et al.  Universal Secure Network Coding via Rank-Metric Codes , 2008, IEEE Transactions on Information Theory.