Autor:	Liu, Yucheng, Ong, Lawrence, Yeoh, Phee Lep, Sadeghi, Parastoo, Kliewer, Joerg, Johnson, Sarah
Rok vydání:	2022
Předmět:	Computer Science - Information Theory Computer Science - Cryptography and Security
Druh dokumentu:	Working Paper
Popis:	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. Comment: Published in Proceedings of IEEE Information Theory Workshop (ITW) 2021
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2205.10821 Zobrazit plný text záznamu View this record from Arxiv