English
Related papers

Related papers: A Variational Formula for Infinity-R\'{e}nyi Diver…

200 papers

We introduce a \emph{gain function} viewpoint of information leakage by proposing \emph{maximal $g$-leakage}, a rich class of operationally meaningful leakage measures that subsumes recently introduced leakage measures -- {maximal leakage}…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Lalitha Sankar , Oliver Kosut

We consider a problem of guessing, wherein an adversary is interested in knowing the value of the realization of a discrete random variable $X$ on observing another correlated random variable $Y$. The adversary can make multiple (say, $k$)…

Information Theory · Computer Science 2021-08-20 Gowtham R. Kurri , Oliver Kosut , Lalitha Sankar

In this paper, we present several novel representations of $\alpha$-mutual information ($\alpha$-MI) in terms of R{\' e}nyi divergence and conditional R{\' e}nyi entropy. The representations are based on the variational characterizations of…

Information Theory · Computer Science 2025-05-01 Akira Kamatsuka , Takashiro Yoshida

We introduce the study of information leakage through \emph{guesswork}, the minimum expected number of guesses required to guess a random variable. In particular, we define \emph{maximal guesswork leakage} as the multiplicative decrease,…

Information Theory · Computer Science 2024-05-07 Gowtham R. Kurri , Malhar Managoli , Vinod M. Prabhakaran

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 $\mathcal{L}(X \!\! \to \!\! Y)$ is called \emph{maximal leakage}, and is…

Information Theory · Computer Science 2018-07-23 Ibrahim Issa , Aaron B. Wagner , Sudeep Kamath

A tunable measure for information leakage called \textit{maximal $\alpha$-leakage} is introduced. This measure quantifies the maximal gain of an adversary in refining a tilted version of its prior belief of any (potentially random) function…

Information Theory · Computer Science 2018-06-12 Jiachun Liao , Oliver Kosut , Lalitha Sankar , Flavio P. Calmon

In this work, maximal $\alpha$-leakage is introduced to quantify how much a quantum adversary can learn about any sensitive information of data upon observing its disturbed version via a quantum privacy mechanism. We first show that an…

Quantum Physics · Physics 2024-03-22 Bo-Yu Yang , Hsuan Yu , Hao-Chung Cheng

We introduce a family of information leakage measures called maximal $\alpha,\beta$-leakage, parameterized by real numbers $\alpha$ and $\beta$. The measure is formalized via an operational definition involving an adversary guessing an…

Information Theory · Computer Science 2022-11-29 Atefeh Gilani , Gowtham R. Kurri , Oliver Kosut , Lalitha Sankar

We propose an operational measure of information leakage in a non-stochastic setting to formalize privacy against a brute-force guessing adversary. We use uncertain variables, non-probabilistic counterparts of random variables, to construct…

Information Theory · Computer Science 2021-01-29 Farhad Farokhi , Ni Ding

This paper proposes an operational measure of non-stochastic information leakage to formalize privacy against a brute-force guessing adversary. The information is measured by non-probabilistic uncertainty of uncertain variables, the…

Information Theory · Computer Science 2021-07-05 Ni Ding , Farhad Farokhi

We introduce a privacy measure called pointwise maximal leakage, generalizing the pre-existing notion of maximal leakage, which quantifies the amount of information leaking about a secret $X$ by disclosing a single outcome of a (randomized)…

Information Theory · Computer Science 2023-08-16 Sara Saeidian , Giulia Cervia , Tobias J. Oechtering , Mikael Skoglund

Maximal $\alpha$-leakage is a tunable measure of information leakage based on the accuracy of guessing an arbitrary function of private data based on public data. The parameter $\alpha$ determines the loss function used to measure the…

Information Theory · Computer Science 2019-04-08 Jiachun Liao , Lalitha Sankar , Oliver Kosut , Flavio P. Calmon

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…

Information Theory · Computer Science 2020-10-22 Amedeo Roberto Esposito , Michael Gastpar , Ibrahim Issa

For $\tilde{f}(t) = \exp(\frac{\alpha-1}{\alpha}t)$, this paper proposes a $\tilde{f}$-mean information gain measure. R\'{e}nyi divergence is shown to be the maximum $\tilde{f}$-mean information gain incurred at each elementary event $y$ of…

Information Theory · Computer Science 2024-07-04 Ni Ding , Mohammad Amin Zarrabian , Parastoo Sadeghi

We introduce a tunable measure for information leakage called maximal alpha-leakage. This measure quantifies the maximal gain of an adversary in inferring any (potentially random) function of a dataset from a release of the data. The…

Information Theory · Computer Science 2019-08-21 Jiachun Liao , Oliver Kosut , Lalitha Sankar , Flavio du Pin Calmon

We leverage the Gibbs inequality and its natural generalization to R\'enyi entropies to derive closed-form parametric expressions of the optimal lower bounds of $\rho$th-order guessing entropy (guessing moment) of a secret taking values on…

Information Theory · Computer Science 2024-01-31 Julien Béguinot , Olivier Rioul

For $\tilde{f}(t) = \exp(\frac{\alpha-1}{\alpha}t)$, this paper shows that the Sibson mutual information is an $\alpha$-leakage averaged over the adversary's $\tilde{f}$-mean relative information gain (on the secret) at elementary event of…

Information Theory · Computer Science 2025-10-09 Ni Ding , Farhad Farokhi , Tao Guo , Yinfei Xu , Xiang Zhang

We introduce a relative variant of information loss to characterize the behavior of deterministic input-output systems. We show that the relative loss is closely related to Renyi's information dimension. We provide an upper bound for…

Information Theory · Computer Science 2012-04-02 Bernhard C. Geiger , Gernot Kubin

This paper proposes an $\alpha$-leakage measure for $\alpha\in[0,\infty)$ by a cross entropy interpretation of R{\'{e}}nyi entropy. While R\'{e}nyi entropy was originally defined as an $f$-mean for $f(t) = \exp((1-\alpha)t)$, we reveal that…

Information Theory · Computer Science 2024-01-30 Ni Ding , Mohammad Amin Zarrabian , Parastoo Sadeghi

The total variation distance is proposed as a privacy measure in an information disclosure scenario when the goal is to reveal some information about available data in return of utility, while retaining the privacy of certain sensitive…

Information Theory · Computer Science 2019-03-05 Borzoo Rassouli , Deniz Gündüz
‹ Prev 1 2 3 10 Next ›