On Secure Network Coding for Multiple Unicast Traffic

DOI10.1109/TIT.2020.2981325zbMATH Open1446.94051arXiv1901.02787OpenAlexW3011793352MaRDI QIDQ5124497FDOQ5124497

Authors: Gaurav Kumar Agarwal, Martina Cardone, Christina Fragouli 

Publication date: 29 September 2020

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

Abstract: This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast scenario, where all destinations are interested in receiving the same message, in this setting different destinations are interested in different messages. The main focus of this paper is on characterizing the secure capacity region, when the adversary has unbounded computational capabilities, but limited network presence. First, an outer bound on the secure capacity region is derived for arbitrary network topologies and general number of destinations. Then, secure transmission schemes are designed and analyzed in terms of achieved rate performance. In particular, for the case of two destinations, it is shown that the designed scheme matches the outer bound, hence characterizing the secure capacity region. It is also numerically verified that the designed scheme matches the outer bound for a special class of networks with general number of destinations, referred to as combination network. Finally, for an arbitrary network topology with general number of destinations, a two-phase polynomial time in the network size scheme is designed and its rate performance {is} compared with the capacity-achieving scheme for networks with two destinations.

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

Recommendations

• Secure network coding for multiple unicast: on the case of single source
• Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
• On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
• An efficient construction of secure network coding
• (Secure) linear network coding multicast
• Secure Network Coding on a Wiretap Network
• Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29)

Cited In (1)

• A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding

This page was built for publication: On Secure Network Coding for Multiple Unicast Traffic

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