Log In | Sign Up | Help
Upload_transparent

Indexing

Your document has been indexed by the following search engines:

Google Bot has been here 10 times.
  • First crawled 5 months ago.
  • Last crawled 12 days ago.
Yahoo! Bot has been here 29 times.
  • First crawled 5 months ago.
  • Last crawled 7 days ago.
MSN Bot has been here 2 times.
  • First crawled 2 months ago.
  • Last crawled about 1 month ago.

Latest Searches Leading to this Doc

Recent search queries to this document:
These queries are updated daily.

ℓ-Diversity: Privacy Beyond k-Anonymity

Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called kappa-anonymity has gained popularity. In a kappa-anonymized dataset, each record is indistinguishable from at least k—1 other records with respect to certain "identifying" attributes. In this paper we show with two simple attacks that a kappa-anonymized dataset has some subtle, but severe privacy problems. First, we show that an attacker can discover the values of sensitive attributes when there is little diversity in those sensitive attributes. Second, attackers often have background knowledge, and we show that kappa-anonymity does not guarantee privacy against attackers using background knowledge. We give a detailed analysis of these two attacks and we propose a novel and powerful privacy definition called ell-diversity. In addition to building a formal foundation for ell-diversity, we show in an experimental evaluation that ell-diversity is practical and can be implemented efficiently.

  • Send This
  • Add_to_favs_transparent
  • Embed
  • Download
  • Flag
  • Add to Favorites

Scribd requires Javascript. Please enable Javascript in your browser.

Document Information

42 Views | 0 Likes | 0 Comments | 0 Favorites

Added By
Description

Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called kappa-anonymity has gained popularity. In a kappa-anonymized dataset, each record is indistinguishable from at least k—1 other records with respect to certain "identifying" attributes. In this paper we show with two simple attacks that a kappa-anonymized dataset has some subtle, but severe privacy problems. First, we show that an attacker can discover the values of sensitive attributes when there is little diversity in those sensitive attributes. Second, attackers often have background knowledge, and we show that kappa-anonymity does not guarantee privacy against attackers using background knowledge. We give a detailed analysis of these two attacks and we propose a novel and powerful privacy definition called ell-diversity. In addition to building a formal foundation for ell-diversity, we show in an experimental evaluation that ell-diversity is practical and can be implemented efficiently.

Pdf_16x16 12 Pages


Date Added

5 months

ago
Category
Tags
Groups
Type

No Document Type.

Copyright

Attribution Non-commercial

More info »