Journal of Combinatorial Theory Series B
Maximum bounded H-matching is Max SNP-complete
Information Processing Letters
Generalizing data to provide anonymity when disclosing information (abstract)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On the design and quantification of privacy preserving data mining algorithms
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Revealing information while preserving privacy
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On the complexity of optimal K-anonymity
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incognito: efficient full-domain K-anonymity
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
To do or not to do: the dilemma of disclosing anonymized data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Privacy via pseudorandom sketches
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Personalized privacy preservation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Anonymizing sequential releases
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Utility-based anonymization using local recoding
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
The VLDB Journal — The International Journal on Very Large Data Bases
Anatomy: simple and effective privacy preservation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Utility-based anonymization for privacy preservation with less information loss
ACM SIGKDD Explorations Newsletter
Approximate algorithms for K-anonymity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
M-invariance: towards privacy preserving re-publication of dynamic datasets
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
k-Unlinkability: A privacy protection model for distributed data
Data & Knowledge Engineering
Minimality attack in privacy preserving data publishing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms
IEEE Transactions on Mobile Computing
Towards optimal k-anonymization
Data & Knowledge Engineering
Dynamic anonymization: accurate statistical analysis with privacy preservation
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Preservation of proximity privacy in publishing numerical sensitive data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An efficient hash-based algorithm for minimal k-anonymity
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
A privacy preserving technique for distance-based classification with worst case privacy guarantees
Data & Knowledge Engineering
Workload-aware anonymization techniques for large-scale datasets
ACM Transactions on Database Systems (TODS)
On disclosure risk analysis of anonymized itemsets in the presence of prior knowledge
ACM Transactions on Knowledge Discovery from Data (TKDD)
Protecting the Publishing Identity in Multiple Tuples
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
T-rotation: Multiple Publications of Privacy Preserving Data Sequence
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Information Leakage in Optimal Anonymized and Diversified Data
Information Hiding
L-Diversity Based Dynamic Update for Large Time-Evolving Microdata
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Anonymizing moving objects: how to hide a MOB in a crowd?
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous privacy preserving publishing of data streams
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Anonymization-based attacks in privacy-preserving data publishing
ACM Transactions on Database Systems (TODS)
Enhanced P-Sensitive K-Anonymity Models for Privacy Preserving Data Publishing
Transactions on Data Privacy
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
(α, k)-anonymous data publishing
Journal of Intelligent Information Systems
Transparent anonymization: Thwarting adversaries who know the algorithm
ACM Transactions on Database Systems (TODS)
The hardness and approximation algorithms for l-diversity
Proceedings of the 13th International Conference on Extending Database Technology
Algorithm-safe privacy-preserving data publishing
Proceedings of the 13th International Conference on Extending Database Technology
Beyond k-Anonymity: A Decision Theoretic Framework for Assessing Privacy Risk
Transactions on Data Privacy
Privacy-preserving data publishing: A survey of recent developments
ACM Computing Surveys (CSUR)
(α, k)-anonymity based privacy preservation by lossy join
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
K-anonymization with minimal loss of information
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Generating microdata with p-sensitive k-anonymity property
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Efficient k-anonymization using clustering techniques
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
The k-anonymity problem is hard
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On the complexity of restricted k-anonymity problem
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Allowing privacy protection algorithms to jump out of local optimums: an ordered greed framework
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
k-jump strategy for preserving privacy in micro-data disclosure
Proceedings of the 13th International Conference on Database Theory
Anonymization of moving objects databases by clustering and perturbation
Information Systems
Approximate algorithms with generalizing attribute values for k-anonymity
Information Systems
Microdata protection through approximate microaggregation
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Resolving the complexity of some data privacy problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Theory of privacy and anonymity
Algorithms and theory of computation handbook
A family of enhanced (L,α)-diversity models for privacy preserving data publishing
Future Generation Computer Systems
Minimizing minimality and maximizing utility: analyzing method-based attacks on anonymized data
Proceedings of the VLDB Endowment
Extended k-anonymity models against sensitive attribute disclosure
Computer Communications
SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness
The VLDB Journal — The International Journal on Very Large Data Bases
A user-oriented anonymization mechanism for public data
DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
Distributing data for secure database services
Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Parameterized complexity of k-anonymity: hardness and tractability
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Can the Utility of Anonymized Data be Used for Privacy Breaches?
ACM Transactions on Knowledge Discovery from Data (TKDD)
Anonymizing binary and small tables is hard to approximate
Journal of Combinatorial Optimization
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The effect of homogeneity on the complexity of k-anonymity
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
An approximate microaggregation approach for microdata protection
Expert Systems with Applications: An International Journal
Cloning for privacy protection in multiple independent data publications
Proceedings of the 20th ACM international conference on Information and knowledge management
Can attackers learn from samples?
SDM'05 Proceedings of the Second VDLB international conference on Secure Data Management
Data anonymization using an improved utility measurement
Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium
Achieving k-anonymity by clustering in attribute hierarchical structures
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Privacy streamliner: a two-stage approach to improving algorithm efficiency
Proceedings of the second ACM conference on Data and Application Security and Privacy
An effective approach for hiding sensitive knowledge in data publishing
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Finding all maximally-matchable edges in a bipartite graph
Theoretical Computer Science
Optimal multivariate 2-microaggregation for microdata protection: a 2-approximation
PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Beyond k-anonymity: a decision theoretic framework for assessing privacy risk
PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Privacy in the electronic society
ICISS'06 Proceedings of the Second international conference on Information Systems Security
Secure distributed computation of anonymized views of shared databases
ACM Transactions on Database Systems (TODS)
A practical approximation algorithm for optimal k-anonymity
Data Mining and Knowledge Discovery
Distributing Data for Secure Database Services
Transactions on Data Privacy
k-indistinguishable traffic padding in web applications
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
Privacy-preserving deletion to generalization-based anonymous database
Proceedings of the CUBE International Information Technology Conference
An automated data utility clustering methodology using data constraint rules
Proceedings of the 2012 international workshop on Smart health and wellbeing
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
An Enhanced Utility-Driven Data Anonymization Method
Transactions on Data Privacy
Efficient discovery of de-identification policy options through a risk-utility frontier
Proceedings of the third ACM conference on Data and application security and privacy
Priority driven k-anonymisation for privacy protection
AusDM '08 Proceedings of the 7th Australasian Data Mining Conference - Volume 87
Bands of privacy preserving objectives: classification of PPDM strategies
AusDM '11 Proceedings of the Ninth Australasian Data Mining Conference - Volume 121
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the problem of releasing tables from a relational database containing personal records, while ensuring individual privacy and maintaining data integrity to the extent possible. One of the techniques proposed in the literature is k-anonymization. A release is considered k-anonymous if the information for each person contained in the release cannot be distinguished from at least k–1 other persons whose information also appears in the release. In the k-Anonymityproblem the objective is to minimally suppress cells in the table so as to ensure that the released version is k-anonymous. We show that the k-Anonymity problem is NP-hard even when the attribute values are ternary. On the positive side, we provide an O(k)-approximation algorithm for the problem. This improves upon the previous best-known O(klog k)-approximation. We also give improved positive results for the interesting cases with specific values of k — in particular, we give a 1.5-approximation algorithm for the special case of 2-Anonymity, and a 2-approximation algorithm for 3-Anonymity.