k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
From MaRDI portal
Publication:4824634
DOI10.1142/S0218488502001648zbMATH Open1085.68589WikidataQ64039008 ScholiaQ64039008MaRDI QIDQ4824634FDOQ4824634
Authors: Latanya Sweeney 
Publication date: 1 November 2004
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Recommendations
Cited In (only showing first 100 items - show all)
- On environment-driven software model for internetware
- The \(l\)-diversity problem: tractability and approximability
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- A firm foundation for statistical disclosure control
- Publishing anonymous survey rating data
- A formal analysis of information disclosure in data exchange
- A polynomial-time approximation to optimal multivariate microaggregation
- Tools for protecting the privacy of specific individuals in video
- Some basics on privacy techniques, anonymization and their big data challenges
- A practical approximation algorithm for optimal \(k\)-anonymity
- A relational perspective of attribute reduction in rough set-based data analysis
- A general approach for optimizing dynamic sensor activation for discrete event systems
- Improving the characterization of P-stability for applications in network privacy
- Approximating degree sequences with regular graphic sequences (extended abstract)
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- Protecting data: a fuzzy approach
- Value versus damage of information release: a data privacy perspective
- Survey of information security
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- Using patterns to form homogeneous teams
- Mining probabilistic automata: a statistical view of sequential pattern mining
- The effect of homogeneity on the complexity of \(k\)-anonymity
- Protecting Data Privacy Through Hard-to-Reverse Negative Databases
- Quantification of integrity
- Generalization-based privacy preservation and discrimination prevention in data publishing and mining
- Preserving worker privacy in crowdsourcing
- Anonymity protocols as noisy channels
- Limiting disclosure of sensitive data in sequential releases of databases
- Sufficiency Revisited: Rethinking Statistical Algorithms in the Big Data Era
- Importance partitioning in micro-aggregation
- DNA-inspired information concealing: a survey
- Extended results on privacy against coalitions of users in user-private information retrieval protocols
- Differentially private response mechanisms on categorical data
- Logical foundations of information disclosure in ontology-based data integration
- Towards the evaluation of time series protection methods
- \(k\)-attribute-anonymity is hard even for \(k=2\)
- Analysis of the univariate microaggregation disclosure risk
- Efficient systematic clustering method for \(k\)-anonymization
- KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm
- Graphic sequences, distances and \(k\)-degree anonymity
- Column generation bounds for numerical microaggregation
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Protecting privacy in data release
- k-Anonymization with Minimal Loss of Information
- A refined complexity analysis of degree anonymization in graphs
- \(k\)-anonymous data collection
- Data and Applications Security XIX
- On compositional reasoning about anonymity and privacy in epistemic logic
- Anonymizing binary and small tables is hard to approximate
- Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
- Constrained obfuscation of relational databases
- Logical characterizations of regular equivalence in weighted social networks
- Linear spaces and transversal designs: \(k\)-anonymous combinatorial configurations for anonymous database search notes
- Title not available (Why is that?)
- \(\varepsilon\)-inclusion: privacy preserving re-publication of dynamic datasets
- A formalization of record linkage and its application to data protection
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
- Lossy kernelization of same-size clustering
- Lossy kernelization of same-size clustering
- Privacy by diversity in sequential releases of databases
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Probability comprehension of differential privacy for privacy protection algorithms: a new measure
- A unified framework for clustering constrained data without locality property
- Generalized bucketization scheme for flexible privacy settings
- Integrating Ethics into the Guidelines for Assessment and Instruction in Statistics Education (GAISE)
- A hybrid approach for scalable sub-tree anonymization over big data using MapReduce on cloud
- Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data
- A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database
- Privacy in elections: \(k\)-anonymizing preference orders
- Protean Signature Schemes
- Statistics and the modern student
- Disclosure control of business microdata: a density-based approach
- 30 years of synthetic data
- Pattern-guided \(k\)-anonymity
- Differential privacy may have a potential optimization effect on some swarm intelligence algorithms besides privacy-preserving
- A generalized approach for social network integration and analysis with privacy preservation
- Sharing privacy protected and statistically sound clinical research data using outsourced data storage
- Privacy in Networks of Interacting Agents
- Differential privacy of hierarchical census data: an optimization approach
- \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes
- Differentially private data publishing for arbitrarily partitioned data
- The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees?
- Conditional anonymity with non-probabilistic adversary
- (k, l)-Clustering for Transactional Data Streams Anonymization
- Anonymizing categorical data with a recoding method based on semantic similarity
- An active global attack model for sensor source location privacy: analysis and countermeasures
- On the complexity of the minimum independent set partition problem
- Towards privacy-preserving data mining in online social networks: distance-grained and item-grained differential privacy
- A weighted K-member clustering algorithm for K-anonymization
- Title not available (Why is that?)
- Processing text for privacy: an information flow perspective
- PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS
- Differentially private distributed logistic regression with the objective function perturbation
- Adversarial machine learning for cybersecurity and computer vision: current developments and challenges
- A game-theoretic approach to indistinguishability of winning objectives as user privacy
- A dynamic anonymization privacy-preserving model based on hierarchical sequential three-way decisions
- Privacy-preserving parameter estimation in distributed cases
- A derivative-free algorithm for refining numerical microaggregation solutions
- Anonymous Data Collection System with Mediators
This page was built for publication: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824634)
