earticle

논문검색

An Approach to Overcome Inference Channels on k-anonymous Data

초록

영어

The concept of k-anonymity protection model has been proposed as an effective way to protect the identities of subjects in a disclosed database. However, from a k-anonymous dataset it may be possible to directly infer private data. This direct disclosure is called attribute linkage. k-anonymity also suffer to another form of attack based on data mining results. In fact, data mining models and patterns pose a privacy threat even if the k-anonymity is satisfied. In this paper, we discuss how the privacy requirements characterized by k-anonymity can be violated by data mining results and introduce an approach to limit privacy breaches. We experiment it by using the adult dataset from the UCI KDD archive. We report the experimental results which show its effectiveness.

목차

Abstract
 1. Introduction
  1.1. How Knowledge Discovery Results Create Inference Channels on k-AnonymousData
  1.2. Contribution and Paper Outline
 2. Related Research and Insights
  2.1. Record Linkage
  2.2. Attribute Linkage
 3. Proposed Approach
  3.1. Problem Definition
  3.2. Algorithm
 4. Experimental Validation
 5. Results and Discussion
 6. Conclusion
 References

저자정보

  • Ousseynou Sané Department of Mathematics, Cheikh Anta Diop University Dakar, Senegal
  • Fodé Camara Department of Mathematics, Cheikh Anta Diop University Dakar, Senegal
  • Samba Ndiaye Department of Mathematics, Cheikh Anta Diop University Dakar, Senegal
  • Yahya Slimani University Department of Computer Science, Faculty of Sciences of Tunis 1060 Tunis, Tunisia

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.