ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
From MaRDI portal
(Redirected from Publication:4824635)
Recommendations
Cited in
(41)- k-Anonymization with Minimal Loss of Information
- Improving Microaggregation for Complex Record Anonymization
- Active linking attacks
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
- \(T\)-closeness slicing: a new privacy-preserving approach for transactional data publishing
- Distributed anonymous data perturbation method for privacy-preserving data mining
- A formalization of record linkage and its application to data protection
- Efficient systematic clustering method for \(k\)-anonymization
- \(\varepsilon\)-inclusion: privacy preserving re-publication of dynamic datasets
- The effect of homogeneity on the complexity of \(k\)-anonymity
- A practical approximation algorithm for optimal \(k\)-anonymity
- Algorithms for efficiently computing structural anonymity in complex networks
- A relational perspective of attribute reduction in rough set-based data analysis
- A dynamic anonymization privacy-preserving model based on hierarchical sequential three-way decisions
- Logical characterizations of regular equivalence in weighted social networks
- Anonymous Data Collection System with Mediators
- Value versus damage of information release: a data privacy perspective
- Building access control policy model for privacy preserving and testing policy conflicting problems
- Dominance-based fuzzy rough set analysis of uncertain and possibilistic data tables
- An efficient method for privacy preserving location queries
- A comparison between local and global recoding algorithms for achieving microdata \(p\)-sensitive \(k\)-anonymity
- D2D big data privacy-preserving framework based on \((a, k)\)-anonymity model
- A logical framework for privacy-preserving social network publication
- On the use of Haar wavelet transform and scaling data perturbation for privacy preserving clustering of large datasets
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Anonymity protocols as noisy channels
- Attribute association based privacy preservation for multi trust level environment
- Quantification of integrity
- A polynomial-time approximation to optimal multivariate microaggregation
- \(k\)-anonymous data collection
- Towards the evaluation of time series protection methods
- On the connections between statistical disclosure control for microdata and some artificial intelligence tools
- A method of eliminating information disclosure in view publishing
- Pattern-guided \(k\)-anonymity
- Data and Applications Security XIX
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- Fixed-parameter tractability of anonymizing data by suppressing entries
- Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data
- Protecting data: a fuzzy approach
- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
This page was built for publication: ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824635)
