Universal Secure Network Coding via Rank-Metric Codes

DOI10.1109/TIT.2010.2090212zbMATH Open1366.94321arXiv0809.3546OpenAlexW2152303628WikidataQ59767700 ScholiaQ59767700MaRDI QIDQ5281101FDOQ5281101

Authors: Danilo Silva, Frank R. Kschischang 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 mu 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-mu 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 ho. In this case, the proposed scheme can be extended to achieve the rate of n- ho-2t-mu packets. This rate is shown to be optimal under the assumption of zero-error communication.

Full work available at URL: https://arxiv.org/abs/0809.3546

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (19)

• Generalized weights: an anticode approach
• Universal secure rank-metric coding schemes with optimal communication overheads
• Theory of supports for linear codes endowed with the sum-rank metric
• How to construct strongly secure network coding scheme
• Rank-metric complementary dual codes
• Construction of LCD-MRD codes of length n > N
• LCP of rank metric codes and its an application
• Rank-metric codes and their duality theory
• Constructions of rank metric codes under actions of the unitary groups
• A new method for ensuring anonymity and security in network coding
• Application of \(\mathcal{T}\)-direct codes in multiple-rate codes
• Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
• On dually almost MRD codes
• Puncturing maximum rank distance codes
• Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
• Equivalence and characterizations of linear rank-metric codes based on invariants
• How to make a linear network code (strongly) secure
• Roos bound for skew cyclic codes in Hamming and rank metric
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring

This page was built for publication: Universal Secure Network Coding via Rank-Metric Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281101)