Model for a common notion of privacy leakage on public database

Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications

Volumn 2, Issue 1, 2011, Pages 50-62

  Kiyomoto, Shinsaku ^a   Martin, Keith M ^b  

^a KDDI R AND D LABORATORIES INC   (Japan)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84863678828     PISSN: 20935374     EISSN: 20935382     Source Type: Journal    
DOI: None     Document Type: Article

References (51)

1. N. R. Adam and J. C. Wortmann, "Security-control methods for statistical databases: A comparative study," ACM Computing Surveys, vol. 21, no. 4, pp. 515-556, 1989.
2. C. Dwork, "Differential privacy," in Proc. of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06), Venice, Italy, LNCS, vol. 4052. Springer-Verlag, July 2006, pp. 1-12.
3. C. Dwork, "Differential privacy: A survey of results," in Proc. of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC'08), Xi'an, China, LNCS, vol. 4978. Springer-Verlag, December 2008, pp. 1-19.
4. S. E. Fienberg and J. McIntyre, "Data swapping: Variations on a theme by dalenius and reiss," in Proc. Of Privacy in Statistical Databases 2004 (PSD'04), Barcelona, Spain, LNCS, vol. 3050. Springer-Verlag, June 2004, pp. 14-29.
5. W. E. Winkler, "Masking and re-identification methods for public-use microdata: Overview and research problems," in Proc. of Privacy in Statistical Databases 2004 (PSD'04), Barcelona, Spain, LNCS, vol. 3050. Springer-Verlag, June 2004, pp. 231-246.
6. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor, "Our data, ourselves: Privacy via distributed noise generation," in Proc. of Eurocrypt 2006, Saint Petersburg, Russia, LNCS, vol. 4004. SpringerVerlag, May-June 2006, pp. 486-503.
7. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Proc. of the 3rd Theory of Cryptography Conference (TCC'06), New York, USA, LNCS, vol. 3876. SpringerVerlag, March 2006, pp. 265-284.
8. C. Dwork, G. N. Rothblum, and S. Vadhan, "Boosting and differential privacy," pp. 51-60, October 2010.
9. P. Kodeswaran and E. Viegas, "Applying differential privacy to search queries in a policy based interactive framework," in Proc. of ACM First International Workshop on Privacy and Anonymity for Very Large Datasets (PAVLAD'09), Hong Kong. ACM Press, November 2009, pp. 25-32.
10. C. Li, M. Hay, V. Rastogi, G. Miklau, and A. McGregor, "Optimizing linear counting queries under differential privacy," in Proc. of the 29th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (PODS'10), Indiana, USA. ACM Press, June 2010, pp. 123-134.
11. I. Mironov, O. Pandey, O. Reingold, and S. Vadhan, "Computational differential privacy," in Proc. Of CRYPTO 2009, Santa Barbara, California, USA, LNCS, vol. 5677. Springer-Verlag, August 2009, pp. 126-142.
12. A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. Vadhan, "The limits of two-party differential privacy," in Proc. of the 51st IEEE Annual Symposium on Foundations of Computer Science (FOCS'10), Las Vagas, USA. IEEE, October 2010, pp. 81-90.
13. A. Groce, J. Katz, and A. Yerukhimovich, "Limits of computational differential privacy in the client/server setting," in Proc. of the 8th Theory of Cryptography Conference (TCC'11), to appear, Brown University, USA, LNCS. Springer-Verlag, March 2011.
14. M. S. Alvim, K. Chatzikokolakis, P. Degano, and C. Palamidessi, "Differential privacy versus quantitative information flow," CoRR, abs/1012.4250, 2010.
15. G. Barthe and B. Kopf, "Information-theoretic bounds for differentially private mechanisms," in IACR Cryptology ePrint Archive: Report 2011/071, http:// www.springerlink.com/ content/ c288812n57277k7r/, 2011.
16. P. Samarati and L. Sweeney, "Generalizing data to provide anonymity when disclosing information," in Proc. of the 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (PODS'98), Seattle, Washington. ACM Press, June 1998, p. 188.
17. P. Samarati, "Protecting respondents' identities in microdata release," IEEE Trans. on Knowledge and Data Engineering, vol. 13, no. 6, pp. 1010-1027, 2001.
18. L. Sweeney, "Achieving k-anonymity privacy protection using generalization and suppression," International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, vol. 10, no. 5, pp. 571-588, 2002.
19. T. Dalenius, "Finding a needle in a haystack -or identifying anonymous census record," Journal of Official Statistics, vol. 2, no. 3, pp. 329-336, 1986.
20. A. Meyerson and R. Williams, "On the complexity of optimal k-anonymity," in Proc. of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'04), Paris, France. ACM Press, June 2004, pp. 223-228.
21. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu, "Anonymizing tables," in Proc. of the 10th International Conference on Database Theory (ICDT'05), Edinburgh, Scotland, LNCS, vol. 3363. Springer-Verlag, January 2005, pp. 246-258.
22. S. S. Al-Fedaghi, "Balanced k-anonymity," World Academy of Science, Engineering and Technology (WASET), vol. 1, no. 6, pp. 179-182, June 2005.
23. nd International Conference on Data Engineering (ICDE'06), Atlanta, USA. IEEE, April 2006, pp. 24-35.
24. A. Machanavajjhala and J. Gehrke and D. Kifer, "t-closeness: Privacy beyond k-anonymity and l-diversity," in Proc. of the 23rd IEEE International Conference on Data Enginering (ICDE'07), Istanbul, Turkey. IEEE, April 2007, pp. 106-115.
25. R. C.-W. Wong, J. Li, A. W.-C. Fu, and K. Wang, "(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing," in Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD'06), Philadelphia, USA. ACM Press, August 2006, pp. 754-759.
26. T. M. Truta and B. Vinay, "Privacy protection: p-sensitive k-anonymity property," in Proc. of the 22nd IEEE International Conference on Data Engineering (ICDE'06), Atlanta, USA. IEEE, April 2006, pp. 94-103.
27. +, α)-sensitive k-anonymity: a new enhanced privacy protection model," in Proc. of the 8th IEEE International Conference on Computer and Information Technology (CIT'08), Sydney, Australia. IEEE, July 2008, pp. 59-64.
28. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu, "Approximation algorithms for k-anonymity," Journal of Privacy Technology, November 2005.
29. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan, "Mondrian multidimensional k-anonymity," in Proc. Of the 22nd International Conference on Data Engineering (ICDE'06), Atlanta, USA. IEEE, April 2006, pp. 25-35.
30. V. S. Iyengar, "Transforming data to satisfy privacy constraints," in Proc. of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD'02), Edmonton, Canada. ACM Press, July 2002, pp. 279-288.
31. J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, and A. W.-C. Fu, "Utility-based anonymization using local recoding," in Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD'06), Philadelphia, USA. ACM Press, August 2006, pp. 785-790.
32. J. Xu and W. Wang and J. Pei, and X. Wang, and B. Shi, and A. W.-C. Fu, "Utility-based anonymization for privacy preservation with less information loss," SIGKDD Explor. Newsl., vol. 8, no. 2, pp. 21-30, 2006.
33. J.-W. Byun, A. Kamra, E. Bertino, and N. Li, "Efficient k-anonymity using clustering technique," in Proc. Of the 12th International Conference on Database Systems for Advanced Applications (DASFAA'07), Bangkok, Thailand, April 2007, pp. 188-200.
34. T. M. Truta and A. Campan, "K-anonymization incremental maintenance and optimization techniques," in Proc. of the 2007 ACM symposium on Applied computing (SAC'07), Seoul, Korea. ACM Press, March 2007, pp. 380-387.
35. J.-L. Lin and M.-C. Wei, "An efficient clustering method for k-anonymization," in Proc. of the 2008 International Workshop on Privacy and Anonymity in Information Society (PAIS'08), Nantes, France. ACM Press, March 2008, pp. 46-50.
36. H. Zhu and X. Ye, "Achieving k-anonymity via a density-based clustering method," in Proc. of Advances in Data and Web Management (APweb/WAIM'07), Huang Shan, China, LNCS. Springer-Verlag, June 2007, pp. 745-752.
37. B. Bayardo and R. Agrawal, "Data privacy through optimal k-anonymity," in Proc. of 21st International Conference on Data Engineering (ICDE'05), Tokyo, Japan, April 2005, pp. 217-228.
38. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan, "Incognito: Efficient full-domain k-anonymity," in Proc. of the 24th ACM SIGMOD International Conference on Management of Data (SIGMOD'05), Baltimore, Maryland, USA. ACM Press, June 2005, pp. 49-60.
39. M. R. Clarkson and F. B. Schneider, "Quantification of integrity," in Proc. of the 23rd IEEE Computer Security Foundations Symposium (CSF'10), Edinburgh, UK. IEEE, July 2010, pp. pp.28-43.
40. T.-S. Hsu, C.-J. Liau, D.-W. Wang, and J. K.-P. Chen, "Quantifying privacy leakage through answering database queries," in Proc. of the 5th International Conference on Information Security (ISC'02), Sao Paulo, Brazil, LNCS, vol. 2433. Springer-Verlag, Septmeber-October 2002, pp. 162-176.
41. Y. C. Chiang, T.-S. Hsu, S. Kuo, and D.-W. Wang, "Preserving confidentially when sharing medical data," in Proc. of Asia Pacific Medical Information Conference, 2000.
42. Y. T. Chiang, Y. C. Chiang, T.-S. Hsu, C.-J. Liau, and D.-W. Wang, "How much privacy? a system to safe guard personal privacy while releasing database," in Proc. of the 3rd International Conference on Rough Sets and Current Trends in Computing (RSCTC'02), Malvern, USA, LNCS, vol. 2475. Spriger-Verlag, October 2002, pp. 226-233.
43. A. Krause and E. Horvitz, "A utility-theoretic approach to privacy and personalization," in Proc. of AAAI'08, Chicago, USA, vol. 2. AAAI Press, July 2008, pp. 1181-1188.
44. A. Krause and E. Horvitz, "A utility-theoretic approach to privacy in online services," Journal of Artificial Intelligence Research, vol. 39, pp. 633-662, 2010.
45. A. Machanavajjhala, J. Gehrke, and D. Kifer, "t-closeness: Privacy beyond k-anonymity and l-diversity," in Proc. of the 23rd IEEE International Conference on Data Engineering (ICDE'07), Istanbul, Turkey. IEEE, April 2007, pp. 106-115.
46. +, α)-sensitive k-anonymity: a new enhanced privacy protection model," in Proc. of the 8th IEEE International Conference on Computer and Information Technology (CIT'08), Sydney, Australia. IEEE, July 2008, pp. 59-64.
47. K. Chaudhuri and N. Mishra, "When random sampling preserves privacy," in Proc. of CRYPTO 2006, Santa Barbara, California, USA, LNCS, vol. 4117. Springer-Verlag, August 2006, pp. 198-213.
48. I. Dinur and K. Nissim, "Revealing information while preserving priovacy," in Proc. of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'03), San Diego, USA. ACM Press, June 2003, pp. 202-210.
49. K. Nissim, S. Raskhodnikova, and A. Smith, "Smooth sensitivity and sampling in private data analysis," in Proc. of the 39th ACM Symposium on Theory of Computing (STOC'07), San Diego, USA. ACM Press, June 2007, pp. 75-84.
50. S. P. Kasiviswanathan and A. Smith, A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information. CoRR, abs/0803.3946, 2008.
51. V. Shmatikov, "Differential privacy," Lecture Slides, The University of Texas at Austin Department of Computer.