Work

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

Year: 2022

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2205.10827

Authors: Liu, Yucheng, Ong, Lawrence, Yeoh, Phee Lep, Sadeghi, Parastoo, Kliewer, Joerg, Johnson, Sarah

Institutions: University of Newcastle Australia, UNSW Canberra, New Jersey Institute of Technology

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4308288765

Cites:

Cited by:

Related to: 10