
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias, "kAnonymity in the Presence of External Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 3, pp. 392403, March, 2010.  
BibTex  x  
@article{ 10.1109/TKDE.2009.120, author = {Dimitris Sacharidis and Kyriakos Mouratidis and Dimitris Papadias}, title = {kAnonymity in the Presence of External Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {22}, number = {3}, issn = {10414347}, year = {2010}, pages = {392403}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.120}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  kAnonymity in the Presence of External Databases IS  3 SN  10414347 SP392 EP403 EPD  392403 A1  Dimitris Sacharidis, A1  Kyriakos Mouratidis, A1  Dimitris Papadias, PY  2010 KW  Privacy KW  kanonymity. VL  22 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] L. Sweeney, “kAnonymity: A Model for Protecting Privacy,” Int'l J. Uncertainty, Fuzziness and KnowledgeBased Systems, vol. 10, no. 5, pp. 557570, 2002.
[2] P. Samarati, “Protecting Respondents' Identities in Microdata Release,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp.10101027, Nov./Dec. 2001.
[3] C. Bettini, X.S. Wang, and S. Jajodia, “The Role of QuasiIdentifiers in kAnonymity Revisited,” Technical Report abs/cs/0611035, Computing Research Repository (CoRR), 2006.
[4] R.J. Bayardo,Jr., and R. Agrawal, “Data Privacy through Optimal kAnonymization,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp.217228, 2005.
[5] J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, and A.W.C. Fu, “UtilityBased Anonymization Using Local Recoding,” Proc. ACM SIGKDD, pp. 785790, 2006.
[6] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, “Incognito: Efficient FullDomain kAnonymity,” Proc. ACM SIGMOD, pp.4960, 2005.
[7] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, “Mondrian Multidimensional kAnonymity,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), p. 25, 2006.
[8] G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu, “Achieving Anonymity via Clustering,” Proc. ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS), pp. 153162, 2006.
[9] A. Meyerson and R. Williams, “On the Complexity of Optimal kAnonymity,” Proc. ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS), pp. 223228, 2004.
[10] G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu, “Anonymizing Tables,” Proc. Int'l Conf. Database Theory (ICDT), pp. 246258, 2005.
[11] C.C. Aggarwal, “On kAnonymity and the Curse of Dimensionality,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 901909, 2005.
[12] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, second ed. SpringerVerlag, 2000.
[13] A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam, “lDiversity: Privacy beyond kAnonymity,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), p. 24, 2006.
[14] X. Xiao and Y. Tao, “Anatomy: Simple and Effective Privacy Preservation,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp.139150, 2006.
[15] Q. Zhang, N. Koudas, D. Srivastava, and T. Yu, “Aggregate Query Answering on Anonymized Tables,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 116125, 2007.
[16] J.W. Byun, Y. Sohn, E. Bertino, and N. Li, “Secure Anonymization for Incremental Data Sets,” Proc. VLDB Workshop Secure Data Management (SDM), pp. 4863, 2006.
[17] X. Xiao and Y. Tao, “mInvariance: Towards Privacy Preserving RePublication of Dynamic Data Sets,” Proc. ACM SIGMOD, pp.689700, 2007.
[18] N. Li, T. Li, and S. Venkatasubramanian, “tCloseness: Privacy beyond kAnonymity and lDiversity,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 106115, 2007.
[19] R.C.W. Wong, A.W.C. Fu, K. Wang, and J. Pei, “Minimality Attack in Privacy Preserving Data Publishing,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 543554, 2007.
[20] D.J. Martin, D. Kifer, A. Machanavajjhala, J. Gehrke, and J.Y. Halpern, “WorstCase Background Knowledge for PrivacyPreserving Data Publishing,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 126135, 2007.
[21] V. Rastogi, S. Hong, and D. Suciu, “The Boundary between Privacy and Utility in Data Publishing,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 531542, 2007.
[22] G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis, “Fast Data Anonymization with Low Information Loss,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 758769, 2007.
[23] M. Terrovitis, N. Mamoulis, and P. Kalnis, “PrivacyPreserving Anonymization of SetValued Data,” Proc. VLDB Endowment, vol. 1, no. 1, pp. 115125, 2008.
[24] M.E. Nergiz, M. Atzori, and C. Clifton, “Hiding the Presence of Individuals from Shared Databases,” Proc. ACM SIGMOD, pp.665676, 2007.
[25] F. Li, M. Hadjieleftheriou, G. Kollios, and L. Reyzin, “Dynamic Authenticated Index Structures for Outsourced Databases,” Proc. ACM SIGMOD, pp. 121132, 2006.
[26] K. Mouratidis, D. Sacharidis, and H.H. Pang, “Partially Materialized Digest Scheme: An Efficient Verification Method for Outsourced Databases,” Int'l J. Very Large Data Bases, vol. 18, no. 1, pp. 363381, 2009.
[27] S. Ruggles, M. Sobek, T. Alexander, C.A. Fitch, R. Goeken, P.K. Hall, M. King, and C. Ronnander, Integrated Public Use Microdata Series: Version 4.0 [MachineReadable Database]. Minnesota Population Center [Producer and Distributor], 2008.