Secure Index Coding: Existence and Construction

Abstract

We investigate the construction of weakly-secure index codes for a sender to send messages to multiple receivers with side information in the presence of an eavesdropper. We derive a sufficient and necessary condition for the existence of index codes that are secure against an eavesdropper with access to any subset of messages of cardinality $t$, for any fixed $t$. In contrast to the benefits of using random keys in secure network coding, we prove that random keys do not promote security in three classes of index-coding instances.

Author final manuscript (to be presented at the 2016 IEEE International Symposium on Information Theory)

References in corpus (2)

• On the Capacity Region for Index Coding
• Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation

Cited by in corpus (7)

• Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers
• Secure Index Coding with Security Constraints on Receivers
• An Equivalence Between Secure Network and Index Coding
• Threshold-Secure Coding with Shared Key
• On Converse Results for Secure Index Coding
• Optimal Weakly Secure Linear Codes for Some Classes of the Two-Sender Index Coding Problem
• Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding