On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
From MaRDI portal
Publication:2989451
DOI10.1109/TIT.2012.2216936zbMATH Open1364.94284arXiv0911.0467OpenAlexW1971450408MaRDI QIDQ2989451FDOQ2989451
Authors: Tao Cui, Tracey Ho, Jörg Kliewer 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper considers secure network coding with nonuniform or restricted wiretap sets, for example, networks with unequal link capacities where a wiretapper can wiretap any subset of links, or networks where only a subset of links can be wiretapped. Existing results show that for the case of uniform wiretap sets (networks with equal capacity links/packets where any can be wiretapped), the secrecy capacity is given by the cut-set bound, and can be achieved by injecting random keys at the source which are decoded at the sink along with the message. This is the case whether or not the communicating users have information about the choice of wiretap set. In contrast, we show that for the nonuniform case, the cut-set bound is not achievable in general when the wiretap set is unknown, whereas it is achievable when the wiretap set is made known. We give achievable strategies where random keys are canceled at intermediate non-sink nodes, or injected at intermediate non-source nodes. Finally, we show that determining the secrecy capacity is a NP-hard problem.
Full work available at URL: https://arxiv.org/abs/0911.0467
Cited In (9)
- Anonymous coherent network coding against eavesdropping and jamming
- Secure Degrees of Freedom of One-Hop Wireless Networks With No Eavesdropper CSIT
- Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels
- On the practicality of cryptographic defences against pollution attacks in wireless network coding
- A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
- Linear provable security for a class of unbalanced Feistel network
- Revisiting a Secret Sharing Approach to Network Codes
- On Secure Network Coding for Multiple Unicast Traffic
- (Secure) linear network coding multicast
This page was built for publication: On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989451)
