Secure Index Coding: Existence and Construction
Information Theory
2016-11-17 v2 math.IT
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 , for any fixed . 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.
Keywords
Cite
@article{arxiv.1602.01149,
title = {Secure Index Coding: Existence and Construction},
author = {Lawrence Ong and Badri N. Vellambi and Phee Lep Yeoh and Jörg Kliewer and Jinhong Yuan},
journal= {arXiv preprint arXiv:1602.01149},
year = {2016}
}
Comments
Author final manuscript (to be presented at the 2016 IEEE International Symposium on Information Theory)