Anonymizing Tables
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the complexity of optimal K-anonymityPublished by Association for Computing Machinery (ACM) ,2004
- Privacy-Preserving Datamining on Vertically Partitioned DatabasesLecture Notes in Computer Science, 2004
- Secure Computation of the k th -Ranked ElementLecture Notes in Computer Science, 2004
- Efficient Private Matching and Set IntersectionLecture Notes in Computer Science, 2004
- 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
- Privacy Preserving Data MiningLecture Notes in Computer Science, 2000
- Privacy-preserving data miningPublished by Association for Computing Machinery (ACM) ,2000
- Maximum bounded H-matching is MAX SNP-completeInformation Processing Letters, 1994
- General factors of graphsJournal of Combinatorial Theory, Series B, 1988