2008 · 63 citations · 35 references
ComputingComputer ScienceData ScienceComputer SecurityData MiningPrivacy EngineeringData AnonymizationData ConfidentialityData PrivacyData ProtectionData SecurityDisclosure ProtectionAnonymizationAnonymization AlgorithmsAnonymization RiskAnonymized Data CollectionGeneralization-based AnonymizationMicrodata AnonymizationPrivacy PreservationSensitive Data Anonymization
This paper deals with a new type of privacy threat, called "corruption" in anonymized data publication. Specifically, an adversary is said to have corrupted some individuals, if s/he has already obtained their sensitive values before consulting the released information. Conventional generalization may lead to severe privacy disclosure in the presence of corruption. Motivated by this, we advocate an alternative anonymization technique that integrates generalization with perturbation and stratified sampling. The integration provides strong privacy guarantees, even if an adversary has corrupted any number of individuals. We verify the effectiveness of the proposed technique through experiments with real data.
35
Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke et al. · ACM Transactions on Knowledge Discovery from Data · 2007 · 3.6K citations
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Ninghui Li, Tiancheng Li, Suresh Venkatasubramanian · 2007 · 3.4K citations
Privacy-preserving data mining
Rakesh Agrawal, Ramakrishnan Srikant · ACM SIGMOD Record · 2000 · 3K citations
L-diversity: privacy beyond k-anonymity
Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer et al. · 2006 · 2.4K citations