skip to main content
10.1145/2213556.2213571acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

A rigorous and customizable framework for privacy

Published:21 May 2012Publication History

ABSTRACT

In this paper we introduce a new and general privacy framework called Pufferfish. The Pufferfish framework can be used to create new privacy definitions that are customized to the needs of a given application. The goal of Pufferfish is to allow experts in an application domain, who frequently do not have expertise in privacy, to develop rigorous privacy definitions for their data sharing needs. In addition to this, the Pufferfish framework can also be used to study existing privacy definitions.

We illustrate the benefits with several applications of this privacy framework: we use it to formalize and prove the statement that differential privacy assumes independence between records, we use it to define and study the notion of composition in a broader context than before, we show how to apply it to protect unbounded continuous attributes and aggregate information, and we show how to use it to rigorously account for prior data releases.

References

  1. N. Adam and J. Worthmann. Security-control methods for statistical databases. ACM Computing Surveys, 21(4):515--556, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. C. Aggarwal, J. Pei, and B. Zhang. On privacy preservation against adversarial data mining. In KDD, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In STOC, pages 609--618, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. J. Cantwell, H. Hogan, and K. M. Styles. The use of statistical methods in the u.s. census: Utah v. evans. The American Statistician, 58(3):203--212, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  5. K. Chaudhuri and N. Mishra. When random sampling preserves privacy. In CRYPTO, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. B.-C. Chen, D. Kifer, K. LeFevre, and A. Machanavajjhala. Privacy-preserving data publishing. Foundations and Trends in Databases, 2(1--2):1--167, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Clifton. Using sample size to limit exposure to data mining. Journal of Computer Security, 8(4), 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Clifton, M. Kantarcioglu, and J. Vaidya. Defining privacy for data mining. In Proc. of the NSF Workshop on Next Generation Data Mining, 2002.Google ScholarGoogle Scholar
  9. C. Clifton and D. Marks. Security and privacy implications of data mining. In Proceedings of the ACM SIGMOD Workshop on Data Mining and Knowledge Discovery, 1996.Google ScholarGoogle Scholar
  10. A. Delis, V. S. Verykios, and A. A. Tsitsonis. A data perturbation approach to sensitive classification rule hiding. In SAC, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Duan. Privacy without noise. In CIKM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Dwork. Differential privacy. In ICALP, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Dwork and M. Naor. On the difficulties of disclosure prevention in statistical databases or the case for differential privacy. JPC, 2(1), 2010.Google ScholarGoogle Scholar
  15. S. E. Fienberg. Confidentiality and disclosure limitation methodology: Challenges for national statistics and statistical research. Technical Report 668, Carnegie Mellon University, 1997.Google ScholarGoogle Scholar
  16. B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey on recent developments. ACM Computing Surveys, 42(4), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. R. Ganta, S. P. Kasiviswanathan, and A. Smith. Composition attacks and auxiliary information in data privacy. In KDD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Gehrke, E. Lui, and R. Pass. Towards privacy for social networks: A zero-knowledge based definition of privacy. In TCC, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. N. Homer, S. Szelinger, M. Redman, D. Duggan, W. Tembe, J. Muehling, J. V. Pearson, D. A. Stephan, S. F. Nelson, and D. W. Craig. Resolving individuals contributing trace amounts of dna to highly complex mixtures using high-density snp genotyping microarrays. PLoS Genet, 4(8), 08 2008.Google ScholarGoogle ScholarCross RefCross Ref
  20. D. Kifer and B.-R. Lin. An axiomatic view of statistical privacy and utility. To appear in Journal of Privacy and Confidentiality.Google ScholarGoogle Scholar
  21. D. Kifer and B.-R. Lin. Towards an axiomatization of statistical privacy and utility. In PODS, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. D. Kifer and A. Machanavajjhala. No free lunch in data privacy. In SIGMOD, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. K. LeFevre, D. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. B.-R. Lin and D. Kifer. A framework for extracting semantic guarantees from privacy definitions. Technical report, Penn State University, 2012.Google ScholarGoogle Scholar
  25. A. Machanavajjhala, D. Kifer, J. Abowd, J. Gehrke, and L. Vilhuber. Privacy: From theory to practice on the map. In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. F. D. McSherry. Privacy integrated queries: An extensible platform for privacy-preserving data analysis. In SIGMOD, pages 19--30, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. I. Mironov, O. Pandey, O. Reingold, and S. Vadhan. Computational differential privacy. In CRYPTO, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. G. V. Moustakides and V. S. Verykios. A maxmin approach for hiding frequent itemsets. Data Knowl. Eng., 65(1), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. J. Natwichai, X. Li, and M. E. Orlowska. A reconstruction-based algorithm for classification rules hiding. In ADC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC, pages 75--84, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. S. R. M. Oliveira and O. R. Zaiane. Algorithms for balancing privacy and knowledge discovery in association rule mining. In International Database Engineering and Applications Symposium, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  32. PREDICT (protected repository for the defense of infrastructure against cyber threats). http://www.cyber.st.dhs.gov/predict/.Google ScholarGoogle Scholar
  33. V. Rastogi, M. Hay, G. Miklau, and D. Suciu. Relationship privacy: Output perturbation for queries with joins. In PODS, pages 107--116, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. P. Samarati. Protecting respondents' identities in microdata release. TKDE, 13(6), 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. S. Sankararaman, G. Obozinski, M. I. Jordan, and E. Halperin. Genomic privacy and limits of individual detection in a pool. Nature genetics, 41(9):965--967, September 2009.Google ScholarGoogle ScholarCross RefCross Ref
  36. V. S. Verykios, E. Bertino, I. N. Fovino, L. P. Provenza, Y. Saygin, and Y. Theodoridis. State-of-the-art in privacy preserving data mining. SIGMOD Rec., 33(1), 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. V. S. Verykios, A. K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni. Association rule hiding. IEEE Trans. Knowl. Data Eng., 16(4), 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. E. T. Wang and G. Lee. An efficient sanitization algorithm for balancing information privacy and knowledge discovery in association patterns mining. Data & Knowledge Engineering, 65(3), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. K. Wang, B. Fung, and P. Yu. Template-based privacy preservation in classification problems. In ICDM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. X. Xiao and Y. Tao. Anatomy: Simple and effective privacy preservation. In VLDB, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. S. Zhou, K. Ligett, and L. Wasserman. Differential privacy with compression. In ISIT, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A rigorous and customizable framework for privacy

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
            May 2012
            332 pages
            ISBN:9781450312486
            DOI:10.1145/2213556

            Copyright © 2012 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 21 May 2012

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate476of1,835submissions,26%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!