Wiretap networks II with partial information leakage

We investigate wiretap networks II with Ozarow-Wyner's coset coding scheme and consider a more powerful wiretapper who can tap some of the channels, and know part of the source messages in advance. A full characterization of the security performance of the linear network code for the network is given. With respect to a set of full-rank linear network code, the relative network generalized Hamming weight (RNGHW) for a nested code, which is a code pair of a linear code and one of its subcodes, is defined. It is proved that the RNGHW of a nested code can completely characterize the security performance of the linear network code for the network. An upper bound on RNGHW is given and the tightness of the upper bound is proved as well.

[1]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..

[2]  Ning Cai,et al.  On the optimality of a construction of secure network codes , 2008, 2008 IEEE International Symposium on Information Theory.

[3]  Victor K.-W. Wei,et al.  Generalized Hamming weights for linear codes , 1991, IEEE Trans. Inf. Theory.

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

[5]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[6]  G. David Forney,et al.  Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.

[7]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[8]  Emina Soljanin,et al.  On Wiretap Networks II , 2007, 2007 IEEE International Symposium on Information Theory.

[9]  Kefei Chen,et al.  Some new characters on the wire-tap channel of type II , 2005, IEEE Transactions on Information Theory.