k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A probabilistic perspective on re-identifiability
- Graphic sequences, distances and \(k\)-degree anonymity
- Vine copula statistical disclosure control for mixed-type data
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
- Local differentially private frequency estimation based on learned sketches
- DP-STGAT: traffic statistics publishing with differential privacy and a spatial-temporal graph attention network
- Computing covariance and correlation in optimally privacy-protected statistical databases: feasible algorithms
- Prophet: a context-aware location privacy-preserving scheme in location sharing service
- Differentially-private learning of low dimensional manifolds
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Achieving differential privacy of trajectory data publishing in participatory sensing
- Achieving privacy-preserving cross-silo anomaly detection using federated XGBoost
- Protecting privacy in data release
- An algebraic theory for data linkage
- k-Anonymization with Minimal Loss of Information
- A refined complexity analysis of degree anonymization in graphs
- \(k\)-anonymous data collection
- On compositional reasoning about anonymity and privacy in epistemic logic
- Cryptographic technology for benefiting from Big Data
- Anonymizing binary and small tables is hard to approximate
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
- Fuzzy microaggregation for the transparency principle
- Data and Applications Security XIX
- Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
- A balm: defend the clique-based attack from a fundamental aspect
- Constrained obfuscation of relational databases
- On the use of Haar wavelet transform and scaling data perturbation for privacy preserving clustering of large datasets
- Logical characterizations of regular equivalence in weighted social networks
- Enhancing social network privacy with accumulated non-zero prior knowledge
- The analysis of singletons in generalized birthday problems
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
- Expendend \(p\)-sensitive \(k\)-anonymity
- Examining statistical disclosure issues involving digital images of ROC curves
- Design and realization of privacy guaranteeing means for context-sensitive systems.
- Privacy preserving and fast decision for novelty detection using support vector data description
- Linear spaces and transversal designs: \(k\)-anonymous combinatorial configurations for anonymous database search notes
- A differentiated anonymity algorithm for social network privacy preservation
- \(\varepsilon\)-inclusion: privacy preserving re-publication of dynamic datasets
- Balancing Inferential Integrity and Disclosure Risk Via Model Targeted Masking and Multiple Imputation
- scientific article; zbMATH DE number 7387533 (Why is no real title available?)
- CDPS: a cryptographic data publishing system
- Smart contract-driven mechanism design to mitigate information diffusion in social networks
- Statically defend network consumption against acker failure vulnerability in storm
- Covariance's loss is privacy's gain: computationally efficient, private and accurate synthetic data
- Differential privacy protection scheme based on community density aggregation and matrix perturbation
- Differentially private outcome-weighted learning for optimal dynamic treatment regime estimation
- Highly private large-sample tests for contingency tables
- Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
- On distributed \(k\)-anonymization
- A formalization of record linkage and its application to data protection
- Discrimination- and privacy-aware patterns
- Privacy by diversity in sequential releases of databases
- Lossy kernelization of same-size clustering
- The l-diversity problem: tractability and approximability
- On environment-driven software model for internetware
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Lossy kernelization of same-size clustering
- A unified framework for clustering constrained data without locality property
- Probability comprehension of differential privacy for privacy protection algorithms: a new measure
- A firm foundation for statistical disclosure control
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- Generalized bucketization scheme for flexible privacy settings
- A hybrid approach for scalable sub-tree anonymization over big data using MapReduce on cloud
- Publishing anonymous survey rating data
- A formal analysis of information disclosure in data exchange
- Integrating Ethics into the Guidelines for Assessment and Instruction in Statistics Education (GAISE)
- Tools for protecting the privacy of specific individuals in video
- A polynomial-time approximation to optimal multivariate microaggregation
- A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database
- Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data
- Privacy in elections: \(k\)-anonymizing preference orders
- Some basics on privacy techniques, anonymization and their big data challenges
- Pattern-guided \(k\)-anonymity
- A relational perspective of attribute reduction in rough set-based data analysis
- Protean Signature Schemes
- A practical approximation algorithm for optimal \(k\)-anonymity
- Statistics and the modern student
- Disclosure control of business microdata: a density-based approach
- 30 years of synthetic data
- Sharing privacy protected and statistically sound clinical research data using outsourced data storage
- Differential privacy may have a potential optimization effect on some swarm intelligence algorithms besides privacy-preserving
- Improving the characterization of P-stability for applications in network privacy
- Approximating degree sequences with regular graphic sequences (extended abstract)
- A generalized approach for social network integration and analysis with privacy preservation
- A general approach for optimizing dynamic sensor activation for discrete event systems
- Differential privacy of hierarchical census data: an optimization approach
- Privacy in Networks of Interacting Agents
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- Differentially private data publishing for arbitrarily partitioned data
- \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes
- Value versus damage of information release: a data privacy perspective
- Protecting data: a fuzzy approach
- Survey of information security
- Using patterns to form homogeneous teams
- Conditional anonymity with non-probabilistic adversary
- The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees?
- Mining probabilistic automata: a statistical view of sequential pattern mining
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- The effect of homogeneity on the complexity of \(k\)-anonymity
- Anonymizing categorical data with a recoding method based on semantic similarity
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)
