ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
From MaRDI portal
Publication:4824635
DOI10.1142/S021848850200165XzbMath1084.68537MaRDI QIDQ4824635
Publication date: 1 November 2004
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021848850200165x
68P25: Data encryption (aspects in computer science)
Related Items
T-Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing, Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries, Quantification of integrity, Attribute association based privacy preservation for multi trust level environment, A relational perspective of attribute reduction in rough set-based data analysis, Dominance-based fuzzy rough set analysis of uncertain and possibilistic data tables, \(k\)-anonymous data collection, Efficient systematic clustering method for \(k\)-anonymization, Towards the evaluation of time series protection methods, Fixed-parameter tractability of anonymizing data by suppressing entries, Value versus damage of information release: a data privacy perspective, \(\varepsilon\)-inclusion: privacy preserving re-publication of dynamic datasets, Distributed anonymous data perturbation method for privacy-preserving data mining, Pattern-guided \(k\)-anonymity, An efficient method for privacy preserving location queries, On the connections between statistical disclosure control for microdata and some artificial intelligence tools, Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy, Logical characterizations of regular equivalence in weighted social networks, D2D big data privacy-preserving framework based on \((a, k)\)-anonymity model, Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs, A polynomial-time approximation to optimal multivariate microaggregation, The effect of homogeneity on the computational complexity of combinatorial data anonymization, A logical framework for privacy-preserving social network publication, Anonymity protocols as noisy channels, Building access control policy model for privacy preserving and testing policy conflicting problems, ON THE USE OF HAAR WAVELET TRANSFORM AND SCALING DATA PERTURBATION FOR PRIVACY PRESERVING CLUSTERING OF LARGE DATASETS, Active Linking Attacks, Anonymous Data Collection System with Mediators, A FORMALIZATION OF RECORD LINKAGE AND ITS APPLICATION TO DATA PROTECTION, The Effect of Homogeneity on the Complexity of k-Anonymity, A method of eliminating information disclosure in view publishing, Protecting data: a fuzzy approach, Improving Microaggregation for Complex Record Anonymization
