Approximate algorithms for K-anonymity

  title={Approximate algorithms for K-anonymity},
  author={Hyoungmin Park and Kyuseok Shim},
  booktitle={SIGMOD Conference},
When a table containing individual data is published, disclosure of sensitive information should be prohibitive. A naive approach for the problem is to remove identifiers such as name and social security number. However, linking attacks which joins the published table with other tables on some attributes, called quasi-identifier, may reveal the sensitive information. To protect privacy against linking attack, the notion of k-anonymity which makes each record in the table be indistinguishable… CONTINUE READING
Highly Cited
This paper has 129 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 85 extracted citations

A practical approximation algorithm for optimal k-anonymity

Data Mining and Knowledge Discovery • 2011
View 13 Excerpts
Highly Influenced

Anonymizing Set-Valued Social Data

2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing • 2010
View 5 Excerpts
Highly Influenced

Anonymizing Unstructured Data

View 7 Excerpts
Highly Influenced

Towards optimal sensitivity-based anonymization for big data

2017 27th International Telecommunication Networks and Applications Conference (ITNAC) • 2017
View 3 Excerpts
Highly Influenced

A General Survey of Privacy-Preserving Data Mining Models and Algorithms

Privacy-Preserving Data Mining • 2008
View 3 Excerpts
Highly Influenced

A Deep Learning Approach for Privacy Preservation in Assisted Living

2018 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) • 2018
View 1 Excerpt

130 Citations

Citations per Year
Semantic Scholar estimates that this publication has 130 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-2 of 2 references

Anonymizing Tables

ICDT • 2005
View 7 Excerpts
Highly Influenced

On the Complexity of Optimal K-Anonymity

View 10 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…