Universal weakly secure network coding
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 281-285
Abstract
This paper considers the problem of secure network coding under the weak (and practically appealing) security requirements of Bhattad and Narayanan. Weak security allows communication at maximum rate while ensuring that only meaningless information is leaked to a wiretapper. Differently from the approach of Bhattad and Narayanan, which requires a joint design of the underlying network code and the outer security scheme, we propose a universal approach that is completely independent of the network code. In particular, the field size for linear network coding operations does not need to be enlarged. The scheme is also compatible with random network coding.Keywords
This publication has 7 references indexed in Scilit:
- A Rank-Metric Approach to Error Control in Random Network CodingIEEE Transactions on Information Theory, 2008
- Security for wiretap networks via rank-metric codes2008
- On Wiretap Networks II2007
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- Wire-Tap Channel II2000
- Network information flowIEEE Transactions on Information Theory, 2000