On the Security of Index Coding With Side Information

Security aspects of the index coding with side information (ICSI) problem are investigated. Building on the results of Bar-Yossef (2006), the properties of linear index codes are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security. It is shown that the linear index code based on a matrix <i>L</i>, whose column space code <i>C</i>(<i>L</i>) has length <i>n</i>, minimum distance <i>d</i> , and dual distance <i>d</i>^⊥ , is (<i>d</i>-1-<i>t</i>) -block secure (and hence also weakly secure) if the adversary knows in advance <i>t</i> ≤ <i>d</i>-2 messages, and is completely insecure if the adversary knows in advance more than <i>n</i> - <i>d</i>^⊥ messages. Strong security is examined under the conditions that the adversary: 1) possesses <i>t</i> messages in advance; 2) eavesdrops at most μ transmissions; 3) corrupts at most δ transmissions. We prove that for sufficiently large <i>q</i> , an optimal linear index code which is strongly secure against such an adversary has length κ_q+μ+2δ . Here, κ_q is a generalization of the min-rank over F_q of the side information graph for the ICSI problem in its original formulation in the work of Bar-Yossef et al.