38 citations · 85 across the 13 of their papers we have counts for
7 papers · 1 filter
Tunable Measures for Information Leakage and Applications to Privacy-Utility Tradeoffs
Jiachun Liao, Oliver Kosut, Lalitha Sankar +1
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)…
Hypothesis Testing under Mutual Information Privacy Constraints in the High Privacy Regime
Jiachun Liao, Lalitha Sankar, Vincent Y. F. Tan +1
Hypothesis testing is a statistical inference framework for determining the true distribution among a set of possible distributions for a given dataset. Privacy restrictions may re…
Principal Inertia Components and Applications
Flavio P. Calmon, Ali Makhdoumi, Muriel Médard +3
We explore properties and applications of the Principal Inertia Components (PICs) between two discrete random variables and . The PICs lie in the intersection of information…
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels
Flavio P. Calmon, Yury Polyanskiy, Yihong Wu
This paper quantifies the intuitive observation that adding noise reduces available information by means of non-linear strong data processing inequalities. Consider the random vari…
Multi-user guesswork and brute force security
Mark M. Christiansen, Ken R. Duffy, Flavio du Pin Calmon +1
The Guesswork problem was originally motivated by a desire to quantify computational security for single user systems. Leveraging recent results from its analysis, we extend the re…
Guessing a password over a wireless channel (on the effect of noise non-uniformity)
Mark M. Christiansen, Ken R. Duffy, Flavio du Pin Calmon +1
A string is sent over a noisy channel that erases some of its characters. Knowing the statistical properties of the string's source and which characters were erased, a listener tha…
Brute force searching, the typical set and Guesswork
Mark M. Christiansen, Ken R. Duffy, Flavio du Pin Calmon +1
Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word v…