An information-theoretic approach to privacy

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1220-1227

  Sankar, Lalitha ^a   Rajagopalan, S Raj ^b   Poor, H Vincent ^a  

^a Princeton University   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL MODEL; ELECTRONIC DATA SOURCES; INFORMATION-THEORETIC APPROACH; PERSONALLY IDENTIFIABLE INFORMATION; STATE-OF-THE-ART APPROACH; TIGHT BOUND; UNSOLVED PROBLEMS;

MATHEMATICAL MODELS;

INFORMATION THEORY;

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

References (28)

1. R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystem," Communications of the ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
2. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
3. A. D. Wyner, "The wire-tap channel," Bell Sys. Tech. J., vol. 54, pp. 1355-1387, 1975.
4. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee, "Towards privacy in public databases," in Proc. 2nd IACR Theory Crypto. Conf., Cambridge, MA, Feb. 2005, pp. 363-385.
5. N. R. Adam and J. C. Wortmann, "Security-control methods for statistical databases: A comparative study," ACM Computing Surveys, vol. 21, no. 4, pp. 515-556, 1989.
6. T. Dalenius, "Finding a needle in a haystack - or identifying anonymous census records," J. Official Stats., vol. 2, no. 3, pp. 329-336, 1986.
7. L. Sweeney, "k-anonymity: A model for protecting privacy," IEEE Trans. Inform. Theory, vol. 10, no. 5, pp. 557-570, 2002.
8. D. Agrawal and C. Aggarwal, "On the design and quantification of privacy preserving data mining algorithms," in Proc. 20th Symp. Principles of Database Systems, Santa Barbara, CA, May 2001.
9. C. Dwork, "Differential privacy," in Proc. 33rd Intl. Colloq. Automata, Lang., Prog., Venice, Italy, July 2006.
10. H. Yamamoto, "A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers," IEEE Trans. Inform. Theory, vol. 29, no. 6, pp. 918-923, Nov. 1983.
11. C. Dwork, "A firm foundation for private data analysis," Jan. 2011, http://research.microsoft.com/apps/pubs/?id=116123, to appear in Communications of the ACM.
12. M. K. Reiter and A. D. Rubin, "Anonymous web transactions with crowds," Communications of the ACM, vol. 42, no. 2, pp. 32-48, 1999.
13. C. Dwork and A. Smith, "Differential privacy for statistics: what we know and what we want to learn," in Proc. NCHS/CDC Data Confidentiality Workshop, Hyattsville, MD, May 2008.
14. C. Dwork, "Differential privacy: A survey of results," in Theory and Applications of Models of Computation: Lecture Notes in Computer Science. New York:Springer, Apr. 2008.
15. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Proc. 3rd IACR Theory Crypto. Conf., New York, NY, Mar. 2006.
16. S. Chawla, C. Dwork, F. McSherry, and K. Talwar, "On privacy-preserving histograms," in Proc. 21st Conf. Uncert. Art. Intell., Edinburgh, Scotland, July 2005.
17. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigraphy, D. Thomas, and A. Zhu, "Achieving anonymity via clustering," in Proc. Symp. Principles Database Sys., Dallas, TX, June 2006.
18. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, "L-diversity: Privacy beyond k-anonymity," ACM Trans. Knowledge Discov. Data, vol. 1, no. 1, 2007.
19. A. Sarwate and K. Chaudhuri, "Privacy constraints in regularized convex optimization," July 2009, arxiv.org e-print 0907.1413v1.
20. W. Gasarch, "A survey on private information retrieval," Bulletin of the EATCS, vol. 82, pp. 72-107, 2004.
21. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai, "Universally composable two-party and multi-party secure computation," in Proc. 34th Annual ACM Symp. Theory of Computing, Montreal, Quebec, Canada, may 2002, pp. 494-503.
22. O. Goldreich, The Foundations of Cryptography: Basic Tools. Cambridge, UK: Cambridge University Press, 2001.
23. Y. Liang, H. V. Poor, and S. Shamai, Information-theoretic security. Dundrecht, The Netherlands: Now Publishers, 2009.
24. L. Sankar, S. R. Rajagopalan, V. Aggarwal, and H. V. Poor, "Utility and privacy in databases: An information-theoretic approach," 2010, in preparation.
25. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," IRE Nat. Conv. Record, vol. 7, pp. 325-350, 1959.
26. A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. 22, no. 1, pp. 1-10, Jan. 1976.
27. V. Erokhin, "Epsilon-entropy of a discrete random variable," Theory of Probability and Applications, vol. 3, pp. 97-100, 1958.
28. J. T. Pinkston, "An application of rate-distortion theory to a converse to the coding theorem," IEEE Trans. Inform. Theory, vol. 15, no. 1, pp. 66-71, Jan. 1969.