On the Capacity Region for Secure Index Coding

09/10/2018
by   Yuxin Liu, et al.
0

We study the index coding problem in the presence of an eavesdropper, where the aim is to communicate without allowing the eavesdropper to learn any single message aside from the messages it may already know as side information. We establish an outer bound on the underlying secure capacity region of the index coding problem, which includes polymatroidal and security constraints, as well as the set of additional decoding constraints for legitimate receivers. We then propose a secure variant of the composite coding scheme, which yields an inner bound on the secure capacity region of the index coding problem. For the achievability of secure composite coding, a secret key with vanishingly small rate may be needed to ensure that each legitimate receiver who wants the same message as the eavesdropper, knows at least two more messages than the eavesdropper. For all securely feasible index coding problems with four or fewer messages, our numerical results establish the secure index coding capacity region.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/21/2020

Secure Index Coding with Security Constraints on Receivers

Index coding is concerned with efficient broadcast of a set of messages ...
research
01/27/2018

Capacity Theorems for Distributed Index Coding

In index coding, a server broadcasts multiple messages to their respecti...
research
04/26/2018

A Code Equivalence between Secure Network and Index Coding

A code equivalence between index coding and network coding was establish...
research
01/09/2019

On Secure Network Coding for Multiple Unicast Traffic

This paper investigates the problem of secure communication in a wirelin...
research
05/30/2020

Private Index Coding

We study the fundamental problem of index coding under an additional pri...
research
05/11/2023

Preferential Pliable Index Coding

We propose and study a variant of pliable index coding (PICOD) where rec...
research
05/15/2021

On Converse Results for Secure Index Coding

In this work, we study the secure index coding problem where there are s...

Please sign up or login with your details

Forgot password? Click here to reset