2020Unpublished venueRequires access

Anonymous Privacy Protection Algorithm Based on Sensitive Attribute Classification

Chen Lian, Zhanfang Chen

Open publisher page 6 citations

Abstract

At present, most personalized privacy protection algorithms can be divided into two methods for protecting sensitive attributes. One is to set different thresholds for different sensitive attributes; the other is to generalize sensitive attributes, and replace the original sensitive attribute values with lowprecision generalized values. The anonymized data of the two methods has the risk of sensitive information leakage or large information loss, as well as the problem of data availability. To this end, a personalized (α, p, k) anonymous privacy protection algorithm is proposed. According to the sensitive level of the sensitive attribute, different anonymous methods are adopted for the sensitive values of each level in the equivalence class, so as to realize personalized privacy protection of the sensitive attribute. Experiments show that this algorithm has an approximate time cost and lower information loss than other personalized privacy protection algorithms.

About this research paper

What this paper is about

At present, most personalized privacy protection algorithms can be divided into two methods for protecting sensitive attributes. One is to set different thresholds for different sensitive attributes; the other is to generalize sensitive attributes, and replace the original sensitive attribute values with lowprecision generalized values. The anonymized data of the two methods has the risk of sensitive information leakage or large information loss, as well as the problem of data availability. To this end, a personalized (α, p, k) anonymous privacy protection algorithm is proposed. According to the sensitive level of the sensitive attribute, different anonymous methods are adopted for the sensitive values of each level in the equivalence class, so as to realize personalized privacy protection of the sensitive attribute. Experiments show that this algorithm has an approximate time cost and lower information loss than other personalized privacy protection algorithms.

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

At present, most personalized privacy protection algorithms can be divided into two methods for protecting sensitive attributes. One is to set different thresholds for different sensitive attributes; the other is to generalize sensitive attributes, and replace the original sensitive attribute values with lowprecision generalized values. The anonymized data of the two methods has the risk of sensitive information leakage or large information loss, as well as the problem of data availability. To this end, a personalized (α, p, k) anonymous privacy protection algorithm is proposed. According to the sensitive level of the sensitive attribute, different anonymous methods are adopted for the sensitive values of each level in the equivalence class, so as to realize personalized privacy protection of the sensitive attribute. Experiments show that this algorithm has an approximate time cost and lower information loss than other personalized privacy protection algorithms.

Key concepts: Computer science, Privacy protection, Information sensitivity, Information loss, Data mining, Information privacy, Equivalence (formal languages), k-anonymity

Related papers

Back to paper searchBrowse research topicsOriginal source
Anonymous Privacy Protection Algorithm Based on Sensitive Attribute Classification — Research Paper | ScholarLens