On multidimensional k-anonymity with local recoding generalization

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 1422-1424

  Du, Yang ^a   Xia, Tian ^a   Tao, Yufei ^b   Zhang, Donghui ^a   Zhu, Feng ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

APPROXIMATION RATIO; LOCAL-RECODING GENERALIZATION (LRG); TIME COMPLEXITY;

DATA PRIVACY;

EID: 34548748588     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.369026     Document Type: Conference Paper

References (7)

1. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Anonymizing tables. In ICDT, pages 246-258, 2005.
2. S. Khanna, S. Muthukrishnan, and M. Paterson. On Approximating Rectangle Tiling and Packing. In Proc. of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384-393, 1998.
3. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In SIGMOD, pages 49-60, 2005.
4. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE, 2006.
5. D. Lichtenstein. Planar formulae and their uses. SIAM Journal on Computing, 11(2):423-454, 1982.
6. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS, pages 223-228, 2004.
7. D.J. Newman, S. Hettich, C. L. Blake, and C.J. Merz. UCI Repository of machine learning databases, 1998.