Information Leakage in Index Coding
Information Theory
2022-05-24 v1 Cryptography and Security
math.IT
Abstract
We study the information leakage to a guessing adversary in index coding with a general message distribution. Under both vanishing-error and zero-error decoding assumptions, we develop lower and upper bounds on the optimal leakage rate, which are based on the broadcast rate of the subproblem induced by the set of messages the adversary tries to guess. When the messages are independent and uniformly distributed, the lower and upper bounds match, establishing an equivalence between the two rates.
Keywords
Cite
@article{arxiv.2205.10821,
title = {Information Leakage in Index Coding},
author = {Yucheng Liu and Lawrence Ong and Phee Lep Yeoh and Parastoo Sadeghi and Joerg Kliewer and Sarah Johnson},
journal= {arXiv preprint arXiv:2205.10821},
year = {2022}
}
Comments
Published in Proceedings of IEEE Information Theory Workshop (ITW) 2021