On the complexity of optimal K-anonymity
Top Cited Papers
- 14 June 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 223-228
- https://doi.org/10.1145/1055558.1055591
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Limiting privacy breaches in privacy preserving data miningPublished by Association for Computing Machinery (ACM) ,2003
- Revealing information while preserving privacyPublished by Association for Computing Machinery (ACM) ,2003
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- On the design and quantification of privacy preserving data mining algorithmsPublished by Association for Computing Machinery (ACM) ,2001
- Privacy-preserving data miningPublished by Association for Computing Machinery (ACM) ,2000
- Auditing Boolean attributesPublished by Association for Computing Machinery (ACM) ,2000
- Generalizing data to provide anonymity when disclosing information (abstract)Published by Association for Computing Machinery (ACM) ,1998
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974