Security for Wiretap Networks via Rank-Metric Codes
arXiv:0801.0061 · doi:10.1109/ISIT.2008.4594971
Abstract
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver packets from source to each receiver, and the wiretapper can eavesdrop on arbitrarily chosen links. A coding scheme is proposed that can achieve the maximum possible rate of packets that are information-theoretically secure from the adversary. A distinctive feature of our scheme is that it is universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. In fact, even a randomized network code can be used. Our approach is based on Rouayheb-Soljanin's formulation of a wiretap network as a generalization of the Ozarow-Wyner wiretap channel of type II. Essentially, the linear MDS code in Ozarow-Wyner's coset coding scheme is replaced by a maximum-rank-distance code over an extension of the field in which linear network coding operations are performed.
5 pages, to be published at the 2008 IEEE International Symposium on Information Theory
References in corpus (2)
Cited by in corpus (11)
- Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
- Universal Secure Network Coding via Rank-Metric Codes
- On Secure Distributed Data Storage Under Repair Dynamics
- Secure Quantum Network Coding on Butterfly Network
- Network Coding Security: Attacks and Countermeasures
- Universal Secure Error-Correcting Schemes for Network Coding
- Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks
- Secure Network Coding for Wiretap Networks of Type II
- Secure Partial Repair in Wireless Caching Networks with Broadcast Channels
- On (Secure) Information flow for Multiple-Unicast Sessions: Analysis with Butterfly Network
- Performance Bounds on a Wiretap Network with Arbitrary Wiretap Sets