An Extensive Study on Data Anonymization Algorithms Based on K-Anonymity
Explore this paper's citation graph
Summary
This paper proposes three best algorithms along with its efficiency and effectiveness for K-anonymization, and helps researchers to identify the relationship between the values of k, degree of anonymization, choosing a quasi-identifier and focus on execution time.
- Type
- article
- Published
- 2017-08-01
- Cited by
- 19
- References
- 27
- Access
- Open access
- OpenAlex
- https://openalex.org/W2753525591
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:168753035
Keywords
Microdata (statistics), Computer science, Anonymity, Data anonymization, k-anonymity
References
- Introduction to Privacy-Preserving Data Publishing: Concepts and Techniques
- Multirelational k-Anonymity
- Personalized privacy preservation
- (α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
- Anonymizing sequential releases
- Improving the Utility of Differentially Private Data Releases via k-Anonymity
- Generalizing data to provide anonymity when disclosing information (abstract)
- Privacy-Preserving Data Publishing
- Publishing data from electronic health records while preserving privacy: A survey of algorithms
- The Boundary Between Privacy and Utility in Data Publishing
- Achieving k-Anonymity Privacy Protection Using Generalization and Suppression
- Protecting Respondents' Identities in Microdata Release
- L-diversity: privacy beyond k-anonymity
- t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
- k-Anonymity: A Model for Protecting Privacy
- Incognito: efficient full-domain K-anonymity
- Theoretical diversity improvement in GSC(N,L) receiver with nonidentical fading statistics
- A learning theory approach to non-interactive database privacy
- The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East
- IEEE Transactions on Communications
Cited by
- A survey of state-of-the-art methods for securing medical databases
- Privacy, Space and Time: a Survey on Privacy-Preserving Continuous Data Publishing
- K-Anonymity without the Prior Value of the Threshold k: Revisited
- Comparative Study of Greedy K-Member Clustering and Datafly Algorithm Performance
- Mathematics, risk, and messy survey data
- HAC: Model for Privacy-Preserving Outsourced Data Over Cloud
- Open Data Release and Privacy Concerns: Complexity in Mitigating Vulnerability with Controlled Perturbation
- Anonymization Techniques for Privacy Preservation in Social Networks: A Review
- Quasi-Identifier Recognition Algorithm for Privacy Preservation of Cloud Data Based on Risk Reidentification
- Towards Open Science for the Qualitative Researcher: From a Positivist to an Open Interpretation
- The Privacy Issue of Counterfactual Explanations: Explanation Linkage Attacks
- Anonymization and Pseudonymization of FHIR Resources for Secondary Use of Healthcare Data
- Data Security: A Study of Data Anonymization and Several Techniques
- Subtle biases introduced in equity studies through data anonymization
- An Evaluation of Open Source Data Anonymisation Tools for Medical Data
- Prink: ks-Anonymization for Streaming Data in Apache Flink
- Data Security: A Study of Data Anonymization And Several Techniques
- Anonymiza on of directory-structured sensi ve data Anonymisering av katalogstrukturerad känslig data
- Natural Text Anonymization Using Universal Transformer with a Self-attention∗
Related papers
- Fast Data Anonymization with Low Information Loss
- A framework for efficient data anonymization under privacy and accuracy constraints
- Data Anonymization Approach for Incomplete Microdata: Data Anonymization Approach for Incomplete Microdata
- Microdata privacy protection through permutation-based approaches
- Balancing Data Utility versus Information Loss in Data-Privacy Protection using k-Anonymity
- Sensitive attribute based non-homogeneous anonymization for privacy preserving data mining
- Anatomisation with slicing: a new privacy preservation approach for multiple sensitive attributes
- EFFICIENT LOCAL RECODING ANONYMIZATION FOR DATASETS WITHOUT ATTRIBUTE HIERARCHICAL STRUCTURE