Maximal Guesswork Leakage
Preprint
Abstract
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, upon observing $Y$, of the guesswork of a randomized function of $X$, maximized over all such randomized functions. We also study a pointwise form of the leakage which captures the leakage due to the release of a single realization of $Y$. We also study these two notions of leakage with oblivious (or memoryless) guessing. We obtain closed-form expressions for all these leakage measures, with the exception of one. Specifically, we are able to obtain closed-form expression for maximal guesswork leakage for the binary erasure source only; deriving expressions for arbitrary sources appears challenging. Some of the consequences of our results are -- a connection between guesswork and differential privacy and a new operational interpretation to maximal $α$-leakage in terms of guesswork.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Pointwise Maximal LeakageIEEE Transactions on Information Theory, 2023
- On the Lift, Related Privacy Measures, and Applications to Privacy–Utility Trade-OffsEntropy, 2023
- An Operational Approach to Information LeakageIEEE Transactions on Information Theory, 2019
- Tunable Measures for Information Leakage and Applications to Privacy-Utility TradeoffsIEEE Transactions on Information Theory, 2019
- Why Botnets Work: Distributed Brute-Force Attacks Need No SynchronizationIEEE Transactions on Information Forensics and Security, 2019
- What Can We Learn Privately?SIAM Journal on Computing, 2011
- An inequality on guessing and its application to sequential decodingIEEE Transactions on Information Theory, 1996