An Equivalence between Secure Network and Index Coding

  title={An Equivalence between Secure Network and Index Coding},
  author={Lawrence Ong and Badri N. Vellambi and J{\"o}rg Kliewer and Phee Lep Yeoh},
  journal={2016 IEEE Globecom Workshops (GC Wkshps)},
We extend the equivalence between network coding and index coding by Effros, El Rouayheb, and Langberg to the secure communication setting in the presence of an eavesdropper. Specifically, we show that the most general versions of secure network-coding setup by Chan and Grant and the secure index- coding setup by Dau, Skachek, and Chee, which also include the randomised encoding setting, are equivalent. 

Figures from this paper

Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle
  • L. Ong, B. Vellambi
  • Computer Science
    2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
This paper proves the last direction, thereby completing the equivalence between secure network coding and secure index coding, which allows for a network code for any given network-coding instance to be translated to an index code for a suitably constructed index-c coding instance.
Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage
The equivalence between secure index coding and secure network coding is generalised to include non-zero decoding error and non- zero leakage.
A Code and Rate Equivalence Between Secure Network and Index Coding
This article extends the existing equivalence to one between secure index coding and secure network coding, where eavesdroppers are present in the network, and establishes a rate equivalence between these two problems.
Optimal Weakly Secure Linear Codes for Some Classes of the Two-Sender Index Coding Problem
This work provides constructions of weakly secure linear codes for different classes of the two-sender unicast index coding problem, using those of its sub-problems.
Private Index Coding
It is shown that scalar coding is optimal for up to three receivers and scalar linear codes are sub-optimal for four receivers, and when no keys are available, a weaker notion of privacy analogous to weak security is considered.
Code Equivalences Between Network Codes With Link Errors and Index Codes With Side Information Errors
New code equivalence relationships between a network code and an index code are studied and results are generalized to erroneous cases for both a given network coding instance and a given index coding instance.
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers
We characterise the optimal broadcast rate for a few classes of pliable-index-coding problems. This is achieved by devising new lower bounds that utilise the set of absent receivers to construct


Secure index coding: Existence and construction
It is proved that random keys do not promote security in three classes of index-coding instances.
Capacity bounds for secure network coding
  • T. Chan, A. Grant
  • Computer Science
    2008 Australian Communications Theory Workshop
  • 2008
We consider the problem of how to securely communicate over networks subject to presence of eavesdroppers. We obtain inner and outer bounds for the set of rate-capacity tuples at which data can be
On secure network coding with uniform wiretap sets
It is shown that, when network nodes can independently generate randomness, determining the secrecy capacity is at least as difficult as the k-unicast network coding problem and a low-complexity linear optimization-based achievable strategy is proposed involving global random keys that can be generated anywhere in the network.
Secure Network Coding on a Wiretap Network
  • N. Cai, R. Yeung
  • Computer Science
    IEEE Transactions on Information Theory
  • 2011
This paper proposes a model, call the wiretap network, that incorporates information security with network coding, and presents a construction of secure linear network codes that can be used provided a certain graph-theoretic condition is satisfied.
Weakly Secure Network Coding
This work shows that under the new security requirements communication is possible at the multicast capacity and if random coding scheme is used the probability of the system being secure can be made arbitrarily close to one by coding over a large enough field.
Perfectly Secure Index Coding
It is shown that a generalization of Shannon’s one-time pad strategy is optimal up to a multiplicative constant, meaning that it obtains the entire boundary of the cone formed by looking at the secure rate region from the origin.
An Equivalence Between Network Coding and Index Coding
It is shown that the network coding and index coding problems are equivalent and one can determine the capacity region of a given network coding instance with colocated sources by studying the capacity area of a corresponding index coding instance.
On the Security of Index Coding With Side Information
It is proved that for sufficiently large Q, an optimal linear index code which is strongly secure against such an adversary has length κ<sub>q</sub>+μ+2δ .
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
It is shown that vectorlinear codes outperform scalar linear index codes and that vector linear codes are insufficient for achieving the optimum number of transmissions.
Index Coding With Side Information
A measure on graphs, the minrank, is identified, which exactly characterizes the minimum length of linear and certain types of nonlinear INDEX codes and for natural classes of side information graphs, including directed acyclic graphs, perfect graphs, odd holes, and odd anti-holes, minrank is the optimal length of arbitrary INDex codes.