Secure distributed storage systems: Local repair with minimum bandwidth regeneration

This paper addresses the issue of securing information stored on a distributed storage system from a passive eavesdropping attack. The security notion is perfect secrecy, i.e., the system is said to be secure only if the mutual information between the stored information and the observations at the adversary is zero. The paper summarizes state of the art on securing repair-efficient distributed storage systems. Then, storage systems that employ locally repairable codes with minimum bandwidth regenerating codes as local codes (MBR-LRCs) are investigated. A secure file size upper bound and a construction of secure MBR-LRCs are provided. These two are shown to match under special cases, establishing the secrecy capacity of these systems.

[1]  Jehoshua Bruck,et al.  Long MDS codes for optimal repair bandwidth , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[2]  P. Vijay Kumar,et al.  Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[3]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

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

[5]  Sriram Vishwanath,et al.  Explicit MBR all-symbol locality codes , 2013, 2013 IEEE International Symposium on Information Theory.

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

[7]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2014, IEEE Trans. Inf. Theory.

[8]  Kannan Ramchandran,et al.  Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions , 2010, IEEE Transactions on Information Theory.

[9]  Sriram Vishwanath,et al.  Optimal Locally Repairable and Secure Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[10]  Naoto Sasaoka,et al.  Pre-inverse type active noise control with bias free structure , 2014, 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP).

[11]  P. Vijay Kumar,et al.  Codes with local regeneration , 2012, 2013 IEEE International Symposium on Information Theory.

[12]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[13]  Dimitris S. Papailiopoulos,et al.  Repair Optimal Erasure Codes Through Hadamard Designs , 2011, IEEE Transactions on Information Theory.

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

[15]  Sriram Vishwanath,et al.  Error resilience in distributed storage via rank-metric codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[17]  Frédérique E. Oggier,et al.  An Overview of Codes Tailor-made for Networked Distributed Data Storage , 2011, ArXiv.

[18]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[19]  Kannan Ramchandran,et al.  Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks , 2010, IEEE Transactions on Information Theory.

[20]  Jehoshua Bruck,et al.  Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.

[21]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.