2012Journal of SoftwareRequires access

Research on Privacy Preserving on K-anonymity

Yun Pan, Xiao-ling Zhu, Tinggui Chen

Open publisher page 6 citations

Abstract

Abstract—The disclosure of sensitive information has become prominent nowadays; privacy preservation has become a research hotspot in the field of data security. Among all the algorithms of privacy preservation in data mining, K-anonymity is a kind of common and valid algorithm in privacy preservation, which can effectively prevent the loss of sensitive information under linking attacks, and it is widely used in various fields recent years. This article based on the existing K-anonymity privacy preservation of the basic ideas and concepts, K-anonymity model, and enhanced the K-anonymity model, and gives a simple example to compare each algorithm; finally, it prospected the development direction of K-anonymity on privacy preservation. Index Terms—data mining; privacy preservation; K-anonymity; generalization & suppression; the enhanced K-anonymity I.

About this research paper

What this paper is about

Abstract—The disclosure of sensitive information has become prominent nowadays; privacy preservation has become a research hotspot in the field of data security. Among all the algorithms of privacy preservation in data mining, K-anonymity is a kind of common and valid algorithm in privacy preservation, which can effectively prevent the loss of sensitive information under linking attacks, and it is widely used in various fields recent years. This article based on the existing K-anonymity privacy preservation of the basic ideas and concepts, K-anonymity model, and enhanced the K-anonymity model, and gives a simple example to compare each algorithm; finally, it prospected the development direction of K-anonymity on privacy preservation. Index Terms—data mining; privacy preservation; K-anonymity; generalization & suppression; the enhanced K-anonymity I.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract—The disclosure of sensitive information has become prominent nowadays; privacy preservation has become a research hotspot in the field of data security. Among all the algorithms of privacy preservation in data mining, K-anonymity is a kind of common and valid algorithm in privacy preservation, which can effectively prevent the loss of sensitive information under linking attacks, and it is widely used in various fields recent years. This article based on the existing K-anonymity privacy preservation of the basic ideas and concepts, K-anonymity model, and enhanced the K-anonymity model, and gives a simple example to compare each algorithm; finally, it prospected the development direction of K-anonymity on privacy preservation. Index Terms—data mining; privacy preservation; K-anonymity; generalization & suppression; the enhanced K-anonymity I.

Key concepts: Computer science, Anonymity, k-anonymity, Internet privacy, Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on Privacy Preserving on K-anonymity — Research Paper | ScholarLens