Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 54 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 105 tok/s Pro
Kimi K2 182 tok/s Pro
GPT OSS 120B 466 tok/s Pro
Claude Sonnet 4 40 tok/s Pro
2000 character limit reached

Quantifying Privacy via Information Density (2402.12967v1)

Published 20 Feb 2024 in cs.IT, cs.CR, and math.IT

Abstract: We examine the relationship between privacy metrics that utilize information density to measure information leakage between a private and a disclosed random variable. Firstly, we prove that bounding the information density from above or below in turn implies a lower or upper bound on the information density, respectively. Using this result, we establish new relationships between local information privacy, asymmetric local information privacy, pointwise maximal leakage and local differential privacy. We further provide applications of these relations to privacy mechanism design. Furthermore, we provide statements showing the equivalence between a lower bound on information density and risk-averse adversaries. More specifically, we prove an equivalence between a guessing framework and a cost-function framework that result in the desired lower bound on the information density.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. T. J. Oechtering, S. Saeidan, and C. Magnusson Sjöberg, “Calculated privacy: Tech meets law & law meets tech,” FIU Law Review, vol. 17, no. 2, p. 383, 2023.
  2. J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Local privacy and statistical minimax rates,” in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.   IEEE, 2013, pp. 429–438.
  3. G. R. Kurri, L. Sankar, and O. Kosut, “An operational approach to information leakage via generalized gain functions,” IEEE Transactions on Information Theory, pp. 1–1, 2023.
  4. S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Estimation efficiency under privacy constraints,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1512–1534, 2018.
  5. B. Rassouli and D. Gündüz, “On perfect privacy,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 1, pp. 177–191, 2021.
  6. ——, “Optimal utility-privacy trade-off with total variation distance as a privacy measure,” IEEE Transactions on Information Forensics and Security, vol. 15, pp. 594–603, 2019.
  7. B. Razeghi, F. P. Calmon, D. Gündüz, and S. Voloshynovskiy, “On perfect obfuscation: Local information geometry analysis,” in 2020 IEEE International Workshop on Information Forensics and Security (WIFS), 2020, pp. 1–6.
  8. S. Asoodeh, F. Alajaji, and T. Linder, “Notes on information-theoretic privacy,” in 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).   IEEE, 2014, pp. 1272–1278.
  9. ——, “On maximal correlation, mutual information and data privacy,” in 2015 IEEE 14th Canadian workshop on information theory (CWIT).   IEEE, 2015, pp. 27–31.
  10. S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Information extraction under privacy constraints,” Information, vol. 7, no. 1, p. 15, 2016.
  11. J. Liao, L. Sankar, V. Y. Tan, and F. du Pin Calmon, “Hypothesis testing under mutual information privacy constraints in the high privacy regime,” IEEE Transactions on Information Forensics and Security, vol. 13, no. 4, pp. 1058–1071, 2017.
  12. A. Makhdoumi, S. Salamatian, N. Fawaz, and M. Médard, “From the information bottleneck to the privacy funnel,” in 2014 IEEE Information Theory Workshop (ITW 2014).   IEEE, 2014, pp. 501–505.
  13. A. Zamani, T. J. Oechtering, and M. Skoglund, “On the privacy-utility trade-off with and without direct access to the private data,” IEEE Transactions on Information Theory, 2023.
  14. F. du Pin Calmon, A. Makhdoumi, M. Médard, M. Varia, M. Christiansen, and K. R. Duffy, “Principal inertia components and applications,” IEEE Transactions on Information Theory, vol. 63, no. 8, pp. 5011–5038, 2017.
  15. H. Wang, L. Vo, F. P. Calmon, M. Médard, K. R. Duffy, and M. Varia, “Privacy with estimation guarantees,” IEEE Transactions on Information Theory, vol. 65, no. 12, pp. 8025–8042, 2019.
  16. M. Lopuhaä-Zwakenberg, “The privacy funnel from the viewpoint of local differential privacy,” arXiv preprint arXiv:2002.01501, 2020.
  17. H. Hsu, S. Asoodeh, and F. P. Calmon, “Information-theoretic privacy watchdogs,” in 2019 IEEE International Symposium on Information Theory (ISIT), 2019, pp. 552–556.
  18. P. Sadeghi, N. Ding, and T. Rakotoarivelo, “On properties and optimization of information-theoretic privacy watchdog,” in 2020 IEEE Information Theory Workshop (ITW).   IEEE, 2021, pp. 1–5.
  19. B. Wu, A. B. Wagner, and G. E. Suh, “Optimal mechanisms under maximal leakage,” in 2020 IEEE Conference on Communications and Network Security (CNS), 2020, pp. 1–6.
  20. S. Saeidian, G. Cervia, T. J. Oechtering, and M. Skoglund, “Optimal maximal leakage-distortion tradeoff,” in 2021 IEEE Information Theory Workshop (ITW).   IEEE, 2021, pp. 1–6.
  21. A. Zamani, T. J. Oechtering, and M. Skoglund, “A design framework for strongly χ𝜒\chiitalic_χ22{}^{2}start_FLOATSUPERSCRIPT 2 end_FLOATSUPERSCRIPT-private data disclosure,” IEEE Transactions on Information Forensics and Security, vol. 16, pp. 2312–2325, 2021.
  22. ——, “Data disclosure with non-zero leakage and non-invertible leakage matrix,” IEEE Transactions on Information Forensics and Security, vol. 17, pp. 165–179, 2021.
  23. F. du Pin Calmon and N. Fawaz, “Privacy against statistical inference,” in 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012, pp. 1401–1408.
  24. B. Jiang, M. Li, and R. Tandon, “Context-aware data aggregation with localized information privacy,” in 2018 IEEE Conference on Communications and Network Security (CNS).   IEEE, 2018, pp. 1–9.
  25. ——, “Local information privacy and its application to privacy-preserving data aggregation,” IEEE Transactions on Dependable and Secure Computing, vol. 19, no. 3, pp. 1918–1935, 2020.
  26. B. Jiang, M. Seif, R. Tandon, and M. Li, “Context-aware local information privacy,” IEEE Transactions on Information Forensics and Security, vol. 16, pp. 3694–3708, 2021.
  27. 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.
  28. ——, “Asymmetric local information privacy and the watchdog mechanism,” in 2022 IEEE Information Theory Workshop (ITW), 2022, pp. 7–12.
  29. 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.
  30. ——, “Pointwise maximal leakage on general alphabets,” in 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 388–393.
  31. M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, “Measuring information leakage using generalized gain functions,” in IEEE 25th Comp. Security Found. Symp., 2012.
  32. L. Grosse, S. Saeidian, and T. Oechtering, “Extremal mechanisms for pointwise maximal leakage,” arXiv preprint arXiv:2310.07381, 2023.
  33. S. Saeidian, G. Cervia, T. J. Oechtering, and M. Skoglund, “Rethinking disclosure prevention with pointwise maximal leakage,” 2023. [Online]. Available: https://people.kth.se/~oech/JPC23.pdf
  34. P. Kairouz, S. Oh, and P. Viswanath, “Extremal mechanisms for local differential privacy,” The Journal of Machine Learning Research, vol. 17, no. 1, pp. 492–542, 2016.
  35. 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.
  36. G. Smith, “On the foundations of quantitative information flow,” in International Conference on Foundations of Software Science and Computational Structures.   Springer, 2009, pp. 288–302.
  37. 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.   University of California Press, 1961, pp. 547–562.
Citations (5)
View on Semantic Scholar
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets