On Locating Byzantine Attackers

We examine networks that employ network coding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the sub- space properties of (randomized) network coding to develop algorithms to locate the Byzantine attackers.

[1]  Zhen Zhang,et al.  Network Error Correction Coding in Packetized Networks , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[2]  Tracey Ho,et al.  Resilient Network Coding in the Presence of Byzantine Adversaries , 2007, INFOCOM.

[3]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[4]  Suhas N. Diggavi,et al.  Subspace Properties of Randomized Network Coding , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

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

[6]  Christina Fragouli,et al.  Bottleneck discovery and overlay management in network coded peer-to-peer systems , 2007, INM '07.

[7]  Ning Cai,et al.  Network Error Correction, II: Lower Bounds , 2006, Commun. Inf. Syst..

[8]  Tracey Ho,et al.  Byzantine modification detection in multicast networks using randomized network coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[10]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[11]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.