On the Security of Index Coding with Side Information
Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee

TL;DR
This paper explores the security properties of linear index codes in the ICSI problem, including weak, block, and strong security, providing bounds and conditions under which these codes are secure against various adversaries.
Contribution
It generalizes the notion of weak security to block security and derives bounds for strongly secure index codes considering multiple adversarial capabilities.
Findings
Linear index codes can be $(d-1-t)$-block secure based on code parameters.
Complete insecurity occurs if the adversary knows more than $n - d$ messages.
Optimal strongly secure codes have length $oxed{ ext{length} = ext{min-rank} + ext{eavesdropping} + 2 imes ext{corruption}}$ under certain conditions.
Abstract
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 , whose column space code has length , minimum distance and dual distance , is -block secure (and hence also weakly secure) if the adversary knows in advance messages, and is completely insecure if the adversary knows in advance more than messages. Strong security is examined under the conditions that the adversary: (i) possesses messages in advance; (ii) eavesdrops at most transmissions; (iii) corrupts at most …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Wireless Communication Security Techniques · Coding theory and cryptography
