Maximal Guesswork Leakage
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 $\alpha$-leakage in terms of guesswork.
- G. Smith, “On the foundations of quantitative information flow,” in International Conference on Foundations of Software Science and Computational Structures, 2009, pp. 288–302.
- C. Braun, K. Chatzikokolakis, and C. Palamidessi, “Quantitative notions of leakage for one-try attacks,” Electronic Notes in Theoretical Computer Science, vol. 249, pp. 75–91, 2009.
- F. du Pin Calmon and N. Fawaz, “Privacy against statistical inference,” in 50th annual Allerton conference on communication, control, and computing (Allerton). IEEE, 2012, pp. 1401–1408.
- S. A. Osia, B. Rassouli, H. Haddadi, H. R. Rabiee, and D. Gündüz, “Privacy against brute-force inference attacks,” in 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019, pp. 637–641.
- I. Issa, A. B. Wagner, and S. Kamath, “An operational approach to information leakage,” IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1625–1657, 2020.
- J. Liao, L. Sankar, O. Kosut, and F. P. Calmon, “Maximal α𝛼\alphaitalic_α-leakage and its properties,” in IEEE Conference on Communications and Network Security, 2020, pp. 1–6.
- F. Farokhi and N. Ding, “Measuring information leakage in non-stochastic brute-force guessing,” in 2020 IEEE Information Theory Workshop (ITW). IEEE, 2021, pp. 1–5.
- S. Saeidian, G. Cervia, T. J. Oechtering, and M. Skoglund, “Pointwise maximal leakage,” IEEE Transactions on Information Theory, vol. 69, no. 12, pp. 8054–8080, 2023.
- M. A. Zarrabian, N. Ding, and P. Sadeghi, “On the lift, related privacy measures, and applications to privacy–utility trade-offs,” Entropy, vol. 25, no. 4, p. 679, 2023.
- J. L. Massey, “Guessing and entropy,” in Proceedings of 1994 IEEE International Symposium on Information Theory, 1994, p. 204.
- J. O. Pliam, “The disparity between work and entropy in cryptology.” IACR Cryptol. ePrint Arch., vol. 1998, p. 24, 1998.
- E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 99–105, 1996.
- M. J. Hanawal and R. Sundaresan, “Randomized attacks on passwords,” in DRDO-IISc Programme on Advanced Research in Mathematical Engineering, 2010.
- S. Boztas, “Oblivious distributed guessing,” in IEEE International Symposium on Information Theory Proceedings, 2012, pp. 2161–2165.
- W. Huleihel, S. Salamatian, and M. Médard, “Guessing with limited memory,” in IEEE International Symposium on Information Theory (ISIT), 2017, pp. 2253–2257.
- S. Salamatian, W. Huleihel, A. Beirami, A. Cohen, and M. Médard, “Why botnets work: Distributed brute-force attacks need no synchronization,” IEEE Transactions on Information Forensics and Security, vol. 14, no. 9, pp. 2288–2299, 2019.
- S. Arimoto, “Information measures and capacity of order α𝛼\alphaitalic_α for discrete memoryless channels,” Topics in information theory, 1977.
- J. Liao, O. Kosut, L. Sankar, and F. P. Calmon, “Tunable measures for information leakage and applications to privacy-utility tradeoffs,” IEEE Transactions on Information Theory, vol. 65, no. 12, pp. 8043–8066, 2019.
- A. Rényi, “On measures of entropy and information,” in Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics, vol. 4, 1961, pp. 547–562.
- S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, “What can we learn privately?” SIAM Journal on Computing, vol. 40, no. 3, pp. 793–826, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.