Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages

Authors

Yucheng Liu, The University of Newcastle, Australia
Lawrence Ong, The University of Newcastle, Australia
Phee Lep Yeoh, The University of Sydney
Parastoo Sadeghi, University of New South Wales at Australian Defence Force Academy
Joerg Kliewer, New Jersey Institute of Technology
Sarah Johnson, The University of Newcastle, Australia

Document Type

Conference Proceeding

Publication Date

1-1-2022

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.

Identifier

85136293083 (Scopus)

ISBN

[9781665421591]

Publication Title

IEEE International Symposium on Information Theory Proceedings

External Full Text Location

https://doi.org/10.1109/ISIT50566.2022.9834747

ISSN

21578095

First Page

3256

Last Page

3261

Volume

2022-June

Grant

FT190100429

Fund Ref

Australian Research Council

Recommended Citation

Liu, Yucheng; Ong, Lawrence; Lep Yeoh, Phee; Sadeghi, Parastoo; Kliewer, Joerg; and Johnson, Sarah, "Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages" (2022). Faculty Publications. 3431.
https://digitalcommons.njit.edu/fac_pubs/3431