On Wiretap Networks II
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 551-555
Abstract
We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume that the network implements network coding techniques to simultaneously deliver all the packets available at the source to all the destinations. We show how this problem can be looked at as a network generalization of the Ozarow-Wyner wiretap channel of type II. In particular, we show that network security can be achieved by using the Ozarow-Wyner approach of coset coding at the source on top of the implemented network code. This way, we quickly and transparently recover some of the results available in the literature on secure network coding for wiretapped networks. We also derive new bounds on the required secure code alphabet size and an algorithm for code construction.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Resilient network coding in the presence of Byzantine adversaries2007
- Network Error Correction Coding in Packetized Networks2006
- The encoding complexity of network codingIEEE Transactions on Information Theory, 2006
- Information flow decomposition for network codingIEEE Transactions on Information Theory, 2006
- Polynomial Time Algorithms for Multicast Network Code ConstructionIEEE Transactions on Information Theory, 2005
- Byzantine modification detection in multicast networks using randomized network coding2004
- Security based on network topology against the wiretapping attackIEEE Wireless Communications, 2004
- Linear network codingIEEE Transactions on Information Theory, 2003
- Network information flowIEEE Transactions on Information Theory, 2000
- Wire-Tap Channel IIAT&T Bell Laboratories Technical Journal, 1984