An Operational Approach to Information Leakage

DOI10.1109/TIT.2019.2962804MaRDI QIDQ5123810zbMATH OpenOpenAlexFDO

Authors Ibrahim Issa, Aaron B. Wagner, Sudeep Kamath

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.07878

Mathematics Subject Classification ID

Information theory (general) (94A15)

Abstract: Given two random variables $X$ and $Y$, an operational approach is undertaken to quantify the ``leakage of information from $X$ to $Y$. The resulting measure $mathcalL(X!!o!!Y)$ is called emph{maximal leakage}, and is defined as the multiplicative increase, upon observing $Y$, of the probability of correctly guessing a randomized function of $X$, maximized over all such randomized functions. A closed-form expression for $mathcalL(X!!o!!Y)$ is given for discrete $X$ and $Y$, and it is subsequently generalized to handle a large class of random variables. The resulting properties are shown to be consistent with an axiomatic view of a leakage measure, and the definition is shown to be robust to variations in the setup. Moreover, a variant of the Shannon cipher system is studied, in which performance of an encryption scheme is measured using maximal leakage. A single-letter characterization of the optimal limit of (normalized) maximal leakage is derived and asymptotically-optimal encryption schemes are demonstrated. Furthermore, the sample complexity of estimating maximal leakage from data is characterized up to subpolynomial factors. Finally, the emph{guessing} framework used to define maximal leakage is used to give operational interpretations of commonly used leakage measures, such as Shannon capacity, maximal correlation, and local differential privacy.

Recommendations

• A conceptual framework for information-leakage-resilience
• Information leakage detection in boundary ambients
• Quantifying leakage in the presence of unreliable sources of information
• Quantifying Information Leakage in Process Calculi
• Quantifying information leakage in process calculi
• Information leakage analysis by abstract interpretation

Cited in

(5)

• Information leakage due to operative errors in card-based protocols
• PAC privacy: automatic privacy measurement and control of data processing
• Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
• Barycentric and pairwise Rényi quantum leakage with application to privacy-utility trade-off
• Generalization bounds: perspectives from information theory and PAC-Bayes

This page was built for publication: An Operational Approach to Information Leakage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5123810)