Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages
Abstract
Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the sensitive messages to the adversary. We construct a deterministic linear coding scheme, developed from the rank minimization method based on fitting matrices (Bar-Yossef et al. 2011). The linear scheme leads to a novel upper bound on the optimal information leakage rate, which is proved to be tight over all deterministic scalar linear codes. We also derive a converse result from a graph-theoretic perspective, which holds in general over all deterministic and stochastic coding schemes.
Keywords
Cite
@article{arxiv.2205.10827,
title = {Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages},
author = {Yucheng Liu and Lawrence Ong and Phee Lep Yeoh and Parastoo Sadeghi and Joerg Kliewer and Sarah Johnson},
journal= {arXiv preprint arXiv:2205.10827},
year = {2022}
}
Comments
Accepted by IEEE International Symposium on Information Theory (ISIT) 2022