Maintaining K-anonymity against incremental updates

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2007, Pages

  Pei, Jian ^a   Xu, Jian ^b   Wang, Zhibin ^b   Wang, Wei ^b   Wang, Ke ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

^b FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; STATISTICAL METHODS; STATISTICS;

ACCUMULATED DATA; ANONYMIZATION; DATA OBJECTS; DATABASE MANAGEMENT; EFFECTIVE SOLUTION; GENERAL (CO); INCREMENTAL UPDATES; INFORMATION LOSSES; INTERNATIONAL CONFERENCES; K-ANONYMITY; NEW APPROACHES; PROPERTY (S); PUBLIC DATA SOURCES; REAL-WORLD DATA;

DATA REDUCTION;

EID: 46649101105     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2007.16     Document Type: Conference Paper

References (21)

1. C. C. Aggarwal. On k-anonymity and the curse of dimen-sionality. In VLDB '05.
2. G. Aggarwal, et al. Anonymizing tables. In ICDT'05.
3. G. Aggarwal, et al. Approximation algorithms for k-anonymity. Journal of Privacy Technology, (2005112001).
4. R. J. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE'05, pages 217-228.
5. J. H. Freidman, et al. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., 3(3):209-226, 1977.
6. B. C. M. Fung, et al. Top-down specialization for information and privacy preservation. In ICDE'05, pages 205-216.
7. V. S. Iyengar. Transforming data to satisfy privacy constraints. In KDD'02, pages 279-288.
8. D. Kifer and J. Gehrke. Injecting utility into anonymized datasets. In SIGMOD '06.
9. K. LeFevre, et al. Incognito: Efficient full-domain k-anonymity. In SIGMOD'05.
10. K. LeFevre, et al. Mondrian multidimensional k-anonymity. In ICDE'06.
11. K. LeFevre, et al. Workload-aware anonymization. In KDD'06, pages 277-286.
12. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS'04, pages 223-228.
13. P. Samarati. Protecting respondents' identities in microdata release. IEEE Transactions on Knowledge and Data Engineering, 13(6):1010-1027, 2001.
14. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information. In PODS'98.
15. P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. In Technical Report SRI-CSL-98-04, 1998.
16. L. Sweeney. Achieving k-anonymity privacy protection using generalization and suppression. International Journal on Uncertainty, Fuzziness, and Knowledge-based Systems, 10(5):571-588, 2002.
17. L. Sweeney. K-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness, and Knowledge-based Systems, 10(5):571-588, 2002.
18. K. Wang and B. C. M. Fung. Anonymizing sequential releases. In KDD'06, pages 414-423.
19. K. Wang, et al. Bottom-up generalization: A data mining solution to privacy protection. In ICDM'04, pages 249-256.
20. W. E. Winkler. Using simulated annealing for k-anonymity. Technical Report Statistics 2002-7, U.S. Census Bureau, Statistical Research Division, 2002.
21. J. Xu, et al. Utility-based anonymization using local recoding. In KDD'06, pages 785-790.