On the relation between identifiability, differential privacy, and mutual-information privacy

2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

Volumn , Issue , 2014, Pages 1086-1092

  Wang, Weina ^a   Ying, Lei ^a   Zhang, Junshan ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT NETWORKS;

DIFFERENTIAL PRIVACIES; IDENTIFIABILITY; INPUT AND OUTPUTS; MUTUAL INFORMATIONS;

HAMMING DISTANCE;

EID: 84946690964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2014.7028576     Document Type: Conference Paper

References (28)

1. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Proc. Conf. Theory of Cryptography (TCC), New York, NY, 2006, pp. 265-284.
2. C. Dwork, "Differential privacy," in Proc. Int. Conf. Automata, Languages and Programming (ICALP), Venice, Italy, 2006, pp. 1-12.
3. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor, "Our data, ourselves: privacy via distributed noise generation," in Proc. Annu. Int. Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), St. Petersburg, Russia, 2006, pp. 486-503.
4. K. Nissim, S. Raskhodnikova, and A. Smith, "Smooth sensitivity and sampling in private data analysis," in Proc. Ann. ACM Symp. Theory of Computing (STOC), San Diego, CA, 2007, pp. 75-84.
5. A. Ghosh, T. Roughgarden, and M. Sundararajan, "Universally utilitymaximizing privacy mechanisms," in Proc. Ann. ACM Symp. Theory of Computing (STOC), Bethesda, MD, 2009, pp. 351-360.
6. A. Roth and T. Roughgarden, "Interactive privacy via the median mechanism," in Proc. Ann. ACM Symp. Theory of Computing (STOC), Cambridge, MA, 2010, pp. 765-774.
7. M. Hardt and G. N. Rothblum, "A multiplicative weights mechanism for privacy-preserving data analysis," in Proc. Ann. IEEE Symp. Found. Comput. Sci. (FOCS), Las Vegas, NV, 2010, pp. 61-70.
8. S. Muthukrishnan and A. Nikolov, "Optimal private halfspace counting via discrepancy," in Proc. Ann. ACM Symp. Theory of Computing (STOC), New York, NY, 2012, pp. 1285-1292.
9. A. Blum, K. Ligett, and A. Roth, "A learning theory approach to non-interactive database privacy," in Proc. Ann. ACM Symp. Theory of Computing (STOC), Victoria, Canada, 2008, pp. 609-618.
10. C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. Vadhan, "On the complexity of differentially private data release: efficient algorithms and hardness results," in Proc. Ann. ACM Symp. Theory of Computing (STOC), Bethesda, MD, 2009, pp. 381-390.
11. S. Kasiviswanathan, M. Rudelson, A. Smith, and J. Ullman, "The price of privately releasing contingency tables and the spectra of random matrices with correlated rows," in Proc. Ann. ACM Symp. Theory of Computing (STOC), Cambridge, MA, 2010, pp. 775-784.
12. J. Ullman and S. Vadhan, "PCPs and the hardness of generating private synthetic data," in Proc. Conf. Theory of Cryptography (TCC), Providence, RI, 2011, pp. 400-416.
13. M. Hardt, K. Ligett, and F. McSherry, "A simple and practical algorithm for differentially private data release," in Advances Neural Information Processing Systems (NIPS), Lake Tahoe, NV, 2012, pp. 2348-2356.
14. J. Lee and C. Clifton, "Differential identifiability," in Proc. Ann. ACM SIGKDD Conf. Knowledge Discovery and Data Mining (KDD), Beijing, China, 2012, pp. 1041-1049.
15. N. Li, W. Qardaji, D. Su, Y. Wu, and W. Yang, "Membership privacy: A unifying framework for privacy definitions," in Proc. ACM Conf. Computer Communications Security (CCS), Berlin, Germany, 2013, pp. 889-900.
16. D. Clark, S. Hunt, and P. Malacaria, "Quantitative information flow, relations and polymorphic types," J. Log. and Comput., vol. 15, no. 2, pp. 181-199, Apr. 2005.
17. G. Smith, "On the foundations of quantitative information flow," in Proc. Int. Conf. Foundations of Software Science and Computational Structures (FSSACS), York, UK, 2009, pp. 288-302.
18. K. Chatzikokolakis, T. Chothia, and A. Guha, "Statistical measurement of information leakage," in Tools and Algorithms for the Constr. and Anal. of Syst., 2010, vol. 6015, pp. 390-404.
19. Y. Zhu and R. Bettati, "Anonymity vs. information leakage in anonymity systems," in Proc. IEEE Int. Conf. Distributed Computing Systems (ICDCS), Columbus, OH, 2005, pp. 514-524.
20. K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, "Anonymity protocols as noisy channels," in Proc. Int. Conf. Trustworthy Global Computing (TGC), Lucca, Italy, 2007, pp. 281-300.
21. L. Sankar, S. Rajagopalan, and H. Poor, "Utility-privacy tradeoffs in databases: An information-theoretic approach," IEEE Trans. Inf. Forens. Security, vol. 8, no. 6, pp. 838-852, Jun. 2013.
22. M. S. Alvim, M. E. Andrés, K. Chatzikokolakis, P. Degano, and C. Palamidessi, "Differential privacy: On the trade-off between utility and information leakage," in Formal Aspects of Security and Trust, ser. Lecture Notes in Comput. Sci., 2012, vol. 7140, pp. 39-54.
23. D. J. Mir, "Information-theoretic foundations of differential privacy," in Found. and Practice of Security, ser. Lecture Notes in Comput. Sci., 2013, vol. 7743, pp. 374-381.
24. A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. Vadhan, "The limits of two-party differential privacy," in Proc. Ann. IEEE Symp. Found. Comput. Sci. (FOCS), Las Vegas, NV, 2010, pp. 81-90.
25. W. Wang, L. Ying, and J. Zhang, "On the relation between identifiability, differential privacy and mutual-information privacy," arXiv:1402.3757 [cs.CR], Feb. 2014.
26. F. McSherry and K. Talwar, "Mechanism design via differential privacy," in Proc. Ann. IEEE Symp. Found. Comput. Sci. (FOCS), Providence, RI, 2007, pp. 94-103.
27. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Hoboken, NJ: John Wiley & Sons, 2006.
28. S. Boyd and L. Vandenberghe, Convex Optimization. New York, NY: Cambridge Univ. Press, 2004.