Polytope codes for distributed storage in the presence of an active omniscient adversary

Distributed storage systems are studied in the presence of an active omniscient adversary. The adversary is able to control several storage nodes in the system and alter their behavior. A Polytope code is proposed to handle such an adversary, and it is used to prove a lower bound on the overall storage capacity. Polytope codes have been shown to outperform linear codes over a finite field in defeating active adversaries. In a Polytope code, linear operations are performed over the integers rather than a finite field. This allows examinations of cross-covariances as a sort of parity check, which can improve error detection and correction without sacrificing asymptotic rate.

[1]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[2]  R. Yeung,et al.  NETWORK ERROR CORRECTION , PART I : BASIC CONCEPTS AND UPPER BOUNDS , 2006 .

[3]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, ISIT.

[4]  Tracey Ho,et al.  Network Error Correction With Unequal Link Capacities , 2010, IEEE Transactions on Information Theory.

[5]  Frédérique E. Oggier,et al.  Byzantine fault tolerance of regenerating codes , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

[6]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  T. Ho,et al.  On Linear Network Coding , 2010 .

[8]  Lang Tong,et al.  Nonlinear network coding is necessary to combat general Byzantine attacks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Kannan Ramchandran,et al.  Regenerating codes for errors and erasures in distributed storage , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[10]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[11]  Ning Cai,et al.  Network Error Correction, I: Basic Concepts and Upper Bounds , 2006, Commun. Inf. Syst..

[12]  Alexandros G. Dimakis,et al.  Security in distributed storage systems by communicating a logarithmic number of bits , 2010, 2010 IEEE International Symposium on Information Theory.

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

[14]  R. Yeung,et al.  NETWORK ERROR CORRECTION, PART II: LOWER BOUNDS , 2006 .

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