Privacy preservation of aggregates in hidden databases: Why and how?

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 153-164

  Dasgupta, Arjun ^a   Zhang, Nan ^b   Das, Gautam ^a   Chaudhuri, Surajit ^c  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Hidden databases; Privacy preservation

Indexed keywords

FORM-LIKE INTERFACES; PRIVACY PRESERVATION; PRIVACY PROBLEMS; SEARCH QUERIES;

AGGREGATES;

DATABASE SYSTEMS;

EID: 70849084625     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559863     Document Type: Conference Paper

References (32)

1. [ABE+99] M. Atallah, E. Bertino, A. K. Elmagarmid, M. Ibrahim, V. S. Verykios, Disclose Limitation of Sensitive Rules. Knowledge and Data Exchange Workshop 1999.
2. [AES03] R. Agrawal, A. Evfimievski, and R. Srikant, Information Sharing Across Private Databases. SIGMOD 2003.
3. [AS00] R. Agrawal and R. Srikant, Privacy-Preserving Data Mining, SIGMOD 2000.
4. [AST05] R. Agrawal, R. Srikant, and D. Thomas, Privacy Preserving OLAP, SIGMOD 2005.
5. [BB98] K. Bharat and A. Broder. A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines. WWW 1998.
6. [BG06] Z. Bar-Yossef and M. Gurevich. Random Sampling from a Search Engine's Index. WWW 2006.
7. [BG07] Z. Bar-Yossef and M. Gurevich: Efficient search engine measurements. WWW 2007.
8. [BGM02] N. Bruno, L. Gravano, A. Marian: Evaluating Top-k Queries over Web-Accessible Databases. ICDE 2002.
9. [CC01] J. P. Callan, M. E. Connell: Query-based sampling of text databases. ACM Trans. Inf. Syst. 19(2): 2001.
10. [CH02] K. C-C. Chang, S. Hwang: Minimal probing: supporting expensive predicates for top-k queries. SIGMOD 2002.
11. [CHW+08] M. J. Cafarella, A. Halevy, D. Z. Wang, E. Wu, and Y. Zhang, WebTables: Exploring the Power of Tables on the Web, VLDB 2008.
12. [CKV+03] C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Zhu, Tools for Privacy Preserving Distributed Data Mining, ACM SIGKDD Explorations, 4(28): 2003.
13. [DDM07] A. Dasgupta, G. Das, H. Mannila: A random walk approach to sampling hidden databases. SIGMOD 2007.
14. [DMNS06] C. Dwork, F. McSherry, K. Nissim, and A. Smith, Calibrating noise to sensitivity in private data analysis. Theory of Cryptography Conference 2006.
15. [DZD09] A. Dasgupta, N. Zhang, G. Das: Leveraging COUNT Information in Sampling Hidden Databases. ICDE 2009.
16. [DZDC08] A. Dasgupta, N. Zhang, G. Das, S. Chaudhuri, On Privacy Preservations of Aggregates in Hidden Databases, Technical Report TR-GWU-CS-09-001, George Washington University, 2009.
17. [EDHS07] J. Elson, J. R. Douceur, J. Howell, J. Saul: Asirra: a CAPTCHA that exploits interest-aligned manual image categorization, CCS 2007.
18. [Google08] http://code.google.com/apis/soapsearch/apifaq.html
19. A. Gkoulalas-Divanis and V. S. Verykios, An Integer Programming Approach for Frequent Itemset Hiding. CIKM 2006
20. [HB99] S. Hettich and S. D. Bay, The UCI KDD Archive [http://kdd.ics.uci. edu]. Irvine, CA: University of California, Department of Information and Computer Science. 1999.
21. [HYJS04] Y. Hedley, M. Younas, A. E. James, M. Sanderson: A two-phase sampling technique for information extraction from hidden web databases. WIDM 2004.
22. [HYJS06] Y. Hedley, M. Younas, A. E. James, M. Sanderson: Sampling, information extraction and summarisation of Hidden Web databases. Data Knowl. Eng. 59(2): 2006.
23. [IG02] P. G. Ipeirotis, L. Gravano: Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection. VLDB 2002.
24. [JSSS01] S. Jajodia, P. Samarati, M. L. Sapino, V. S. Subrahmanian, Flexible support for multiple access control policies. TODS 26(2): 2001.
25. [KMN05] K. Kenthapadi, N. Mishra, and K. Nissim, Simulatable auditing. PODS 2005.
26. [MKGV07] A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, l-Diversity: Privacy Beyond k- Anonymity. TKDD 1(1): 2007.
27. [MKK+08] J. Madhavan, D. Ko, Ł. Kot, V. Ganapathy, A. Rasmussen, and A. Halevy, Google's Deep-Web Crawl, VLDB 2008.
28. [NMK+06] S. U. Nabar, B. Marthi, K. Kenthapadi, N. Mishra, and R. Motwani, Towards robustness in query auditing. VLDB 2006.
29. [SCF+96] R. S. Sandhu, E. J. Coyne, H. L. Feinstein, and C. E. Youman, Role-based access control models. IEEE Computer, 29(2): 1996.
30. [Swe02] L. Sweeney, k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledgebased Systems, 10(5): 2002.
31. [VEB+04] V. S. Verykios, A. K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, Association rule hiding, TKDE 16(4): 2004.
32. [ZZ07] N. Zhang and W. Zhao, Privacy-Preserving Data Mining Systems. IEEE Computer, 40(4): 2007.