2011/02/14 by Son Hoang Dau, Dau, Son Hoang, Vitaly Skachek +3 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1102.2797
openalex publication_date 2011/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Security aspects of the Index Coding with Side Information (ICSI) problem are investigated. Building on the results of Bar-Yossef et al. (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 L, whose column space code C(L) has length n, minimum distance d and dual distance d^⊥, is (d-1-t)-block secure (and hence also weakly secure) if the adversary knows in advance t ≤ d-2 messages, and is completely insecure if the adversary knows in advance more than n - d messages. Strong security is examined under the conditions that the adversary: (i) possesses t messages in advance; (ii) eavesdrops at most μ transmissions; (iii) corrupts at most δ transmissions. We prove that for sufficiently large q, 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 Fq of the side information graph for the ICSI problem in its original formulation in the work of Bar- Yossef et al.