Perfectly Secure Index Coding
From MaRDI portal
Publication:4566567
DOI10.1109/TIT.2017.2743688zbMATH Open1390.94666arXiv1504.04494OpenAlexW2746896597MaRDI QIDQ4566567FDOQ4566567
Authors: Mohammad Mahdi Mojahedian, M. R. Aref, Amin Gohari 
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of secret keys with the transmitter. We assume perfect secrecy, meaning that the eavesdropper should not be able to retrieve any information about the message set. We study the minimum key lengths for zero-error and perfectly secure index coding problem. On one hand, this problem is a generalization of the index coding problem (and thus a difficult one). On the other hand, it is a generalization of the Shannon's cipher system. We show that a generalization of Shannon's one-time pad strategy is optimal up to a multiplicative constant, meaning that it obtains the entire boundary of the cone formed by looking at the secure rate region from the origin. Finally, we consider relaxation of the perfect secrecy and zero-error constraints to weak secrecy and asymptotically vanishing probability of error, and provide a secure version of the result, obtained by Langberg and Effros, on the equivalence of zero-error and -error regions in the conventional index coding problem.
Full work available at URL: https://arxiv.org/abs/1504.04494
Cited In (1)
This page was built for publication: Perfectly Secure Index Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566567)
