k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
From MaRDI portal
Publication:4824634
DOI10.1142/S0218488502001648zbMath1085.68589WikidataQ64039008 ScholiaQ64039008MaRDI QIDQ4824634
Publication date: 1 November 2004
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Some basics on privacy techniques, anonymization and their big data challenges ⋮ Differentially private data publishing for arbitrarily partitioned data ⋮ Improving the characterization of P-stability for applications in network 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 ⋮ A firm foundation for statistical disclosure control ⋮ Towards the evaluation of time series protection methods ⋮ Cryptographic Technology for Benefiting from Big Data ⋮ The complex shape of anonymity in cryptocurrencies: case studies from a systematic approach ⋮ THE ANALYSIS OF SINGLETONS IN GENERALIZED BIRTHDAY PROBLEMS ⋮ Survey of information security ⋮ Value versus damage of information release: a data privacy perspective ⋮ Differentially private response mechanisms on categorical data ⋮ Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs ⋮ On the Complexity of the Minimum Independent Set Partition Problem ⋮ Prophet: a context-aware location privacy-preserving scheme in location sharing service ⋮ Parameterized complexity of \(k\)-anonymity: hardness and tractability ⋮ Inference-proof updating of a weakened view under the modification of input parameters ⋮ CDPS: a cryptographic data publishing system ⋮ On the properties that characterize privacy ⋮ Effective privacy preserving data publishing by vectorization ⋮ A formal analysis of information disclosure in data exchange ⋮ Computing Covariance and Correlation in Optimally Privacy-Protected Statistical Databases: Feasible Algorithms ⋮ Fuzzy microaggregation for the transparency principle ⋮ Anonymous Data Collection System with Mediators ⋮ The \(l\)-diversity problem: tractability and approximability ⋮ Privacy in Elections: k-Anonymizing Preference Orders ⋮ A FORMALIZATION OF RECORD LINKAGE AND ITS APPLICATION TO DATA PROTECTION ⋮ Vine copula statistical disclosure control for mixed-type data ⋮ An algebraic theory for data linkage ⋮ Extended results on privacy against coalitions of users in user-private information retrieval protocols ⋮ Publishing anonymous survey rating data ⋮ Enhancing social network privacy with accumulated non-zero prior knowledge ⋮ A polynomial-time approximation to optimal multivariate microaggregation ⋮ A relational perspective of attribute reduction in rough set-based data analysis ⋮ A practical approximation algorithm for optimal \(k\)-anonymity ⋮ KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm ⋮ Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy ⋮ The effect of homogeneity on the computational complexity of combinatorial data anonymization ⋮ Privacy preserving and fast decision for novelty detection using support vector data description ⋮ Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ A hybrid approach for scalable sub-tree anonymization over big data using MapReduce on cloud ⋮ Mining probabilistic automata: a statistical view of sequential pattern mining ⋮ Discrimination- and privacy-aware patterns ⋮ A logical framework for privacy-preserving social network publication ⋮ Linear spaces and transversal designs: \(k\)-anonymous combinatorial configurations for anonymous database search notes ⋮ DNA-inspired information concealing: a survey ⋮ Improving Microaggregation for Complex Record Anonymization ⋮ Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach ⋮ \(k\)-attribute-anonymity is hard even for \(k=2\) ⋮ Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks ⋮ Statically Defend Network Consumption Against Acker Failure Vulnerability in Storm ⋮ Column generation bounds for numerical microaggregation ⋮ Parameterized Complexity of k-Anonymity: Hardness and Tractability ⋮ \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes ⋮ Pattern-guided \(k\)-anonymity ⋮ A differentiated anonymity algorithm for social network privacy preservation ⋮ An Active Global Attack Model for Sensor Source Location Privacy: Analysis and Countermeasures ⋮ Differential privacy of hierarchical Census data: an optimization approach ⋮ \(\varepsilon\)-inclusion: privacy preserving re-publication of dynamic datasets ⋮ On compositional reasoning about anonymity and privacy in epistemic logic ⋮ Constrained obfuscation of relational databases ⋮ Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service ⋮ A weighted K-member clustering algorithm for K-anonymization ⋮ Conditional anonymity with non-probabilistic adversary ⋮ Generalized bucketization scheme for flexible privacy settings ⋮ On environment-driven software model for internetware ⋮ Privacy by diversity in sequential releases of databases ⋮ Importance partitioning in micro-aggregation ⋮ Anonymity protocols as noisy channels ⋮ Anonymizing binary and small tables is hard to approximate ⋮ Efficient secure data publishing algorithms for supporting information sharing ⋮ Logical characterizations of regular equivalence in weighted social networks ⋮ Limiting disclosure of sensitive data in sequential releases of databases ⋮ Processing text for privacy: an information flow perspective ⋮ Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations ⋮ A general approach for optimizing dynamic sensor activation for discrete event systems ⋮ A derivative-free algorithm for refining numerical microaggregation solutions ⋮ \(k\)-anonymous data collection ⋮ Generalization-based privacy preservation and discrimination prevention in data publishing and mining ⋮ Preserving worker privacy in crowdsourcing ⋮ Achieving differential privacy of trajectory data publishing in participatory sensing ⋮ Strongly universally consistent nonparametric regression and classification with privatised data ⋮ Community structure-based trilateral Stackelberg game model for privacy protection ⋮ A unified framework for clustering constrained data without locality property ⋮ Towards Privacy-Preserving Data Mining in Online Social Networks: Distance-Grained and Item-Grained Differential Privacy ⋮ The Effect of Homogeneity on the Complexity of k-Anonymity ⋮ LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks ⋮ Analysis of the univariate microaggregation disclosure risk ⋮ Efficient systematic clustering method for \(k\)-anonymization ⋮ Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts ⋮ PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS ⋮ A balm: defend the clique-based attack from a fundamental aspect ⋮ 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 ⋮ Lossy kernelization of same-size clustering ⋮ Graphic sequences, distances and \(k\)-degree anonymity ⋮ Using patterns to form homogeneous teams ⋮ A refined complexity analysis of degree anonymization in graphs
This page was built for publication: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
