k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
From MaRDI portal
K-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
Recommendations
Cited in
(only showing first 100 items - show all)- Importance partitioning in micro-aggregation
- DNA-inspired information concealing: a survey
- k-Anonymization with Minimal Loss of Information
- On environment-driven software model for internetware
- Analysis of the univariate microaggregation disclosure risk
- The \(l\)-diversity problem: tractability and approximability
- A general approach for optimizing dynamic sensor activation for discrete event systems
- A firm foundation for statistical disclosure control
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
- Improving the characterization of P-stability for applications in network privacy
- Extended results on privacy against coalitions of users in user-private information retrieval protocols
- A formalization of record linkage and its application to data protection
- Efficient systematic clustering method for \(k\)-anonymization
- Mining probabilistic automata: a statistical view of sequential pattern mining
- Approximating degree sequences with regular graphic sequences (extended abstract)
- \(\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
- A refined complexity analysis of degree anonymization in graphs
- A relational perspective of attribute reduction in rough set-based data analysis
- KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm
- Publishing anonymous survey rating data
- Logical characterizations of regular equivalence in weighted social networks
- Value versus damage of information release: a data privacy perspective
- Generalization-based privacy preservation and discrimination prevention in data publishing and mining
- Preserving worker privacy in crowdsourcing
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Linear spaces and transversal designs: \(k\)-anonymous combinatorial configurations for anonymous database search notes
- Lossy kernelization of same-size clustering
- Protecting privacy in data release
- Some basics on privacy techniques, anonymization and their big data challenges
- A formal analysis of information disclosure in data exchange
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- Lossy kernelization of same-size clustering
- Anonymity protocols as noisy channels
- Limiting disclosure of sensitive data in sequential releases of databases
- Survey of information security
- Quantification of integrity
- Logical foundations of information disclosure in ontology-based data integration
- A polynomial-time approximation to optimal multivariate microaggregation
- Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
- scientific article; zbMATH DE number 7387533 (Why is no real title available?)
- \(k\)-anonymous data collection
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- Using patterns to form homogeneous teams
- Towards the evaluation of time series protection methods
- Graphic sequences, distances and \(k\)-degree anonymity
- On compositional reasoning about anonymity and privacy in epistemic logic
- Data and Applications Security XIX
- Column generation bounds for numerical microaggregation
- Privacy by diversity in sequential releases of databases
- Differentially private response mechanisms on categorical data
- Constrained obfuscation of relational databases
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- Anonymizing binary and small tables is hard to approximate
- Protecting Data Privacy Through Hard-to-Reverse Negative Databases
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- \(k\)-attribute-anonymity is hard even for \(k=2\)
- Protecting data: a fuzzy approach
- Sufficiency Revisited: Rethinking Statistical Algorithms in the Big Data Era
- Tools for protecting the privacy of specific individuals in video
- An algebraic theory for data linkage
- (k, l)-Clustering for Transactional Data Streams Anonymization
- \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes
- Towards privacy-preserving data mining in online social networks: distance-grained and item-grained differential privacy
- Differentially-private learning of low dimensional manifolds
- Differentially private data publishing for arbitrarily partitioned data
- Differential privacy may have a potential optimization effect on some swarm intelligence algorithms besides privacy-preserving
- Differentially private distributed logistic regression with the objective function perturbation
- Improving Microaggregation for Complex Record Anonymization
- A derivative-free algorithm for refining numerical microaggregation solutions
- Smart contract-driven mechanism design to mitigate information diffusion in social networks
- Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations
- Strongly universally consistent nonparametric regression and classification with privatised data
- Statically defend network consumption against acker failure vulnerability in storm
- CDPS: a cryptographic data publishing system
- Privacy in elections: \(k\)-anonymizing preference orders
- The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees?
- Finding geometric facilities with location privacy
- Differential privacy of hierarchical census data: an optimization approach
- Effective privacy preserving data publishing by vectorization
- Prophet: a context-aware location privacy-preserving scheme in location sharing service
- \(T\)-closeness slicing: a new privacy-preserving approach for transactional data publishing
- Cryptographic technology for benefiting from Big Data
- Design and realization of privacy guaranteeing means for context-sensitive systems.
- Probability comprehension of differential privacy for privacy protection algorithms: a new measure
- Generalized bucketization scheme for flexible privacy settings
- Anonymizing categorical data with a recoding method based on semantic similarity
- Differentially private outcome-weighted learning for optimal dynamic treatment regime estimation
- Highly private large-sample tests for contingency tables
- Protean Signature Schemes
- A probabilistic perspective on re-identifiability
- Adversarial machine learning for cybersecurity and computer vision: current developments and challenges
- Achieving differential privacy of trajectory data publishing in participatory sensing
- Local differentially private frequency estimation based on learned sketches
- Enhancing social network privacy with accumulated non-zero prior knowledge
- LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks
- A game-theoretic approach to indistinguishability of winning objectives as user privacy
- DP-STGAT: traffic statistics publishing with differential privacy and a spatial-temporal graph attention network
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)
