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)- Analysis of the univariate microaggregation disclosure risk
- Some basics on privacy techniques, anonymization and their big data challenges
- Privacy preserving and fast decision for novelty detection using support vector data description
- Logical foundations of information disclosure in ontology-based data integration
- Discrimination- and privacy-aware patterns
- Pattern-guided k-anonymity
- A differentiated anonymity algorithm for social network privacy preservation
- Conditional anonymity with non-probabilistic adversary
- A practical approximation algorithm for optimal \(k\)-anonymity
- Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
- Mining probabilistic automata: a statistical view of sequential pattern mining
- Generalized bucketization scheme for flexible privacy settings
- Logical characterizations of regular equivalence in weighted social networks
- Processing text for privacy: an information flow perspective
- Strongly universally consistent nonparametric regression and classification with privatised data
- Community structure-based trilateral Stackelberg game model for privacy protection
- LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
- A balm: defend the clique-based attack from a fundamental aspect
- Lossy kernelization of same-size clustering
- Differentially private data publishing for arbitrarily partitioned data
- The complex shape of anonymity in cryptocurrencies: case studies from a systematic approach
- Inference-proof updating of a weakened view under the modification of input parameters
- On the properties that characterize privacy
- An algebraic theory for data linkage
- Enhancing social network privacy with accumulated non-zero prior knowledge
- \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes
- Differential privacy of hierarchical census data: an optimization approach
- A weighted K-member clustering algorithm for K-anonymization
- Efficient secure data publishing algorithms for supporting information sharing
- Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations
- A general approach for optimizing dynamic sensor activation for discrete event systems
- Achieving differential privacy of trajectory data publishing in participatory sensing
- A unified framework for clustering constrained data without locality property
- A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database
- Sharing privacy protected and statistically sound clinical research data using outsourced data storage
- Graphic sequences, distances and \(k\)-degree anonymity
- Using patterns to form homogeneous teams
- A refined complexity analysis of degree anonymization in graphs
- Survey of information security
- Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
- Prophet: a context-aware location privacy-preserving scheme in location sharing service
- CDPS: a cryptographic data publishing system
- Fuzzy microaggregation for the transparency principle
- A polynomial-time approximation to optimal multivariate microaggregation
- The effect of homogeneity on the computational complexity of combinatorial data anonymization
- A hybrid approach for scalable sub-tree anonymization over big data using MapReduce on cloud
- A logical framework for privacy-preserving social network publication
- Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes
- Anonymity protocols as noisy channels
- Effective privacy preserving data publishing by vectorization
- Vine copula statistical disclosure control for mixed-type data
- Tight FPT approximation for constrained k-center and k-supplier
- Improving the characterization of P-stability for applications in network privacy
- A derivative-free algorithm for refining numerical microaggregation solutions
- Towards privacy-preserving data mining in online social networks: distance-grained and item-grained differential privacy
- Approximating degree sequences with regular graphic sequences (extended abstract)
- On the use of Haar wavelet transform and scaling data perturbation for privacy preserving clustering of large datasets
- The analysis of singletons in generalized birthday problems
- Computing covariance and correlation in optimally privacy-protected statistical databases: feasible algorithms
- Anonymous Data Collection System with Mediators
- Privacy in elections: k-anonymizing preference orders
- A formalization of record linkage and its application to data protection
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- Design and realization of privacy guaranteeing means for context-sensitive systems.
- The effect of homogeneity on the complexity of \(k\)-anonymity
- Protecting privacy in data release
- PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS
- Anonymizing categorical data with a recoding method based on semantic similarity
- On the complexity of the minimum independent set partition problem
- Smart contract-driven mechanism design to mitigate information diffusion in social networks
- Statically defend network consumption against acker failure vulnerability in storm
- Differentially private response mechanisms on categorical data
- Protecting data: a fuzzy approach
- Cryptographic technology for benefiting from Big Data
- Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy
- Protecting Data Privacy Through Hard-to-Reverse Negative Databases
- k-Anonymization with Minimal Loss of Information
- Improving Microaggregation for Complex Record Anonymization
- An active global attack model for sensor source location privacy: analysis and countermeasures
- Parameterized complexity of \(k\)-anonymity: hardness and tractability
- The l-diversity problem: tractability and approximability
- Publishing anonymous survey rating data
- A relational perspective of attribute reduction in rough set-based data analysis
- Polymorphic encryption and pseudonymisation in identity management and medical research
- Privacy in Networks of Interacting Agents
- A probabilistic perspective on re-identifiability
- A generalized approach for social network integration and analysis with privacy preservation
- scientific article; zbMATH DE number 6860834 (Why is no real title available?)
- DNA-inspired information concealing: a survey
- \(k\)-attribute-anonymity is hard even for \(k=2\)
- ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
- Column generation bounds for numerical microaggregation
- Using \(k\)-anonymization for registry data: pitfalls and alternatives
- scientific article; zbMATH DE number 7387533 (Why is no real title available?)
- On compositional reasoning about anonymity and privacy in epistemic logic
- Constrained obfuscation of relational databases
- Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data
- \(T\)-closeness slicing: a new privacy-preserving approach for transactional data publishing
- Privacy by diversity in sequential releases of databases
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)
