Universal Secure Network Coding via Rank-Metric Codes
arXiv:0809.3546 · doi:10.1109/TIT.2010.2090212
Abstract
The problem of securing a network coding communication system against an eavesdropper adversary is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the adversary can eavesdrop on μarbitrarily chosen links. The objective is to provide reliable communication to all receivers, while guaranteeing that the source information remains information-theoretically secure from the adversary. A coding scheme is proposed that can achieve the maximum possible rate of n-μpackets. The scheme, which is based on rank-metric codes, has the distinctive property of being universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. The only requirement of the scheme is that the packet length be at least n, which is shown to be strictly necessary for universal communication at the maximum rate. A further scenario is considered where the adversary is allowed not only to eavesdrop but also to inject up to t erroneous packets into the network, and the network may suffer from a rank deficiency of at most ρ. In this case, the proposed scheme can be extended to achieve the rate of n-ρ-2t-μpackets. This rate is shown to be optimal under the assumption of zero-error communication.
12 pages, 1 figure, substantially rewritten and improved. Submitted to IEEE Transactions on Information Theory
References in corpus (6)
- A Rank-Metric Approach to Error Control in Random Network Coding
- On Metrics for Error Correction in Network Coding
- Security for Wiretap Networks via Rank-Metric Codes
- Fast Encoding and Decoding of Gabidulin Codes
- Network Codes Resilient to Jamming and Eavesdropping
- Universal Secure Error-Correcting Schemes for Network Coding
Cited by in corpus (38)
- FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learning
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes
- On Secure Network Coding with Nonuniform or Restricted Wiretap Sets
- Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
- Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
- Secure Multiplex Network Coding
- Network Codes Resilient to Jamming and Eavesdropping
- MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom
- Relative generalized matrix weights of matrix codes for universal security on wire-tap networks
- Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
- Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants
- Subspace Properties of Network Coding and their Applications
- Universal Secure Error-Correcting Schemes for Network Coding
- Secure Network Coding for Wiretap Networks of Type II
- Secure network code over one-hop relay network
- Small Field Size for Secure Network Coding
- Finite-Block-Length Analysis in Classical and Quantum Information Theory
- New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding
- Roos bound for skew cyclic codes in Hamming and rank metric
- Unifying notions of generalized weights for universal security on wire-tap networks
- Hiding Symbols and Functions: New Metrics and Constructions for Information-Theoretic Security
- On the similarities between generalized rank and Hamming weights and their applications to network coding
- Generalized weights: an anticode approach
- Local-Encoding-Preserving Secure Network Coding---Part I: Fixed Security Level
- Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution
- End-to-End Error-Correcting Codes on Networks with Worst-Case Symbol Errors
- On dually almost MRD codes
- Network Coding with Myopic Adversaries
- Rank-metric codes and their duality theory
- Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution
- On Multiplicative Matrix Channels over Finite Chain Rings
- Secure Network Coding over Small Fields
- Reverse Edge Cut-Set Bounds for Secure Network Coding
- Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
- Secret Sharing in the Rank Metric
- Weakly Secure Regenerating Codes for Distributed Storage
- Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks