Journal of Software · 2013 · 44 citations · 11 references
ComputingComputer ScienceInformation TechnologyData ManagementData MiningDatabasesData AnonymizationData PrivacyData ProtectionData SecurityDatabase PrivacyPrivacy-preserving AnalyticsAnonymizationAnonymization AlgorithmsK-anonymityL-diversityMicrodata AnonymizationPrivacy-preserving Data MiningSensitive Data AnonymizationUtility-privacy Tradeoff
Multi-dimension bucketization is a typical method to anonymize multiple sensitive attributes. However, the method leads to low data utility when microdata have more sensitive attributes. In addition, the methods do not generalize quasi-identifiers, which make the anonymous data vulnerable to suffer from linked attacks. To address the problems, the paper proposes a SLOMS method. The method vertically partitions the multiple sensitive attributes into several tables and bucketizes each sensitive attribute table to implement l-diversity. At the same time, it generalizes the quasi-identifiers to implement k-anonymity. The paper also proposes a MSB-KACA algorithm to anonymize microdata with multiple sensitive attributes by SLOMS. Experiments show that SLOMS can generate anonymous tables with less suppression ratio and less distortion compared with generalization and MSB.
11
Finding groups in data: an introduction to cluster analysis
Choice Reviews Online · 1991 · 10.6K citations
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
L-diversity: privacy beyond k-anonymity
Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer et al. · 2006 · 2.4K citations