On the Security of Index Coding With Side Information

DOI10.1109/TIT.2012.2188777MaRDI QIDQ5271926zbMATH OpenFDO

Authors Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.2797

Mathematics Subject Classification ID

Source coding (94A29)

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 $L$, whose column space code $C(L)$ has length $n$, minimum distance $d$ and dual distance $d^{p}erp$, is $(d-1-t)$-block secure (and hence also weakly secure) if the adversary knows in advance $tleqd-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 $mu$ transmissions; (iii) corrupts at most $delta$ transmissions. We prove that for sufficiently large $q$, an optimal linear index code which is strongly secure against such an adversary has length $kapp{a}_q+mu+2delta$. Here $kapp{a}_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.

Recommendations

• Perfectly Secure Index Coding
• The Role of Coded Side Information in Single-Server Private Information Retrieval
• Privacy in Index Coding: $k$ -Limited-Access Schemes
• Secure Source Coding With Action-Dependent Side Information
• An efficient encoding mechanism against eavesdropper with side channel information
• Error Correction for Index Coding With Coded Side Information
• Error Correction for Index Coding With Side Information
• Secure Multiterminal Source Coding With Side Information at the Eavesdropper
• On Secure One-Helper Source Coding With Action-Dependent Side Information
• Secure Cooperative Source-Coding With Side Information at the Eavesdropper

Cited in

(1)

• Bounding the Optimal Rate of the ICSI and ICCSI problem

This page was built for publication: On the Security of Index Coding With Side Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271926)