2010 · 26 citations · 29 references
ComputingData ScienceCryptographyData MiningPrivacy EngineeringData AnonymizationData ConfidentialityData PrivacyData ProtectionDisclosure ProtectionSensitive Data ProtectionAnonymizationAnonymization AlgorithmsAttribute DisclosureGeneralization-based AnonymizationL-diversitySensitive Attribute DisclosureSensitive Data AnonymizationT-closeness
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may be linked to external knowledge to reveal indirect sensitive information of an individual. We formalize the notion of l-diversity and t-closeness for quasi-sensitive attributes, which we call QS l-diversity and QS t-closeness, to prevent indirect sensitive attribute disclosure. We propose a two-phase anonymization algorithm that combines quasi-identifying value generalization and quasi-sensitive value suppression to achieve QS l-diversity and QS t-closeness.
29
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Ninghui Li, Tiancheng Li, Suresh Venkatasubramanian · 2007 · 3.4K citations
L-diversity: privacy beyond k-anonymity
Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer et al. · 2006 · 2.4K citations
Data Privacy through Optimal k-Anonymization
Roberto J. Bayardo, R. Agrawal · 2005 · 1.1K citations