skip to main content
10.1145/1150402.1150460acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

On privacy preservation against adversarial data mining

Published:20 August 2006Publication History

ABSTRACT

Privacy preserving data processing has become an important topic recently because of advances in hardware technology which have lead to widespread proliferation of demographic and sensitive data. A rudimentary way to preserve privacy is to simply hide the information in some of the sensitive fields picked by a user. However, such a method is far from satisfactory in its ability to prevent adversarial data mining. Real data records are not randomly distributed. As a result, some fields in the records may be correlated with one another. If the correlation is sufficiently high, it may be possible for an adversary to predict some of the sensitive fields using other fields.In this paper, we study the problem of privacy preservation against adversarial data mining, which is to hide a minimal set of entries so that the privacy of the sensitive fields are satisfactorily preserved. In other words, even by data mining, an adversary still cannot accurately recover the hidden data entries. We model the problem concisely and develop an efficient heuristic algorithm which can find good solutions in practice. An extensive performance study is conducted on both synthetic and real data sets to examine the effectiveness of our approach.

References

  1. Aggarwal C. C. and Yu P. S. A Condensation Based Approach to Privacy Preserving Data Mining. EDBT Conference, 2004.Google ScholarGoogle Scholar
  2. Agrawal R. and Srikant R. Privacy Preserving Data Mining. Proceedings of the ACM SIGMOD Conference, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Agrawal D. and Aggarwal C. C. On the Design and Quantification of Privacy Preserving Data Mining Algorithms. ACM PODS Conference, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Agrawal R. and Bayardo R. J. Data Privacy through Optimal k-anonymization. ICDE Conference, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Aggarwal C. and Parthasarathy S. Mining Massively Incomplete Data Sets by Conceptual Reconstruction. ACM KDD Conference, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Clifton C. and Marks D. Security and Privacy Implications of Data Mining. ACM SIGMOD DMKD Workshop, 1996.Google ScholarGoogle Scholar
  7. Dalvi N. et al. Adversarial classification. KDD Conference, pp. 99--108, 2004 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Evfimievski A. et al. Privacy Preserving Mining Of Association Rules. ACM KDD Conference, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Liew C. K. et al. A data distortion by probability distribution. ACM TODS, 10(3):395--411, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Rizvi S. and Haritsa J. Maintaining Data Privacy in Association Rule Mining. VLDB Conference, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Rymon R. Search through systematic set enumeration. In Proceedings of KR'92, 1992.Google ScholarGoogle Scholar
  12. Samarati P. and Sweeney L. Protecting Privacy when Disclosing Information: k-Anonymity and its Enforcement Through Generalization and Suppression. Proc. of the IEEE Symposium on Research in Security and Privacy, May 1998.Google ScholarGoogle Scholar
  13. Vaidya J. and Clifton C. Privacy Preserving Association Rule Mining in Vertically Partitioned Data. ACM KDD Conference, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Verykios V. S. et al. Association Rule Hiding, IEEE TKDE, 16(4), 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Xiong H. et al. Privacy Leakage in Multi-relational Databases via Pattern based Semi-Supervised Learning. Univ. of Minnesotta, Technical Report 04--23, 2004.Google ScholarGoogle Scholar

Index Terms

  1. On privacy preservation against adversarial data mining

    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
      KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2006
      986 pages
      ISBN:1595933395
      DOI:10.1145/1150402

      Copyright © 2006 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 August 2006

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader