On the efficiency of checking perfect privacy

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 163-172

  Machanavajjhala, Ashwin ^a   Gehrke, Johannes ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; PRIVACY-PRESERVING; QUERY CONTAINMENT;

INFORMATION SYSTEMS; LARGE SCALE SYSTEMS; USER INTERFACES;

DATA PRIVACY;

EID: 34250669245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142375     Document Type: Conference Paper

References (25)

1. N. R. Adam and J. C. Wortmann. Security-control methods for statistical databases: A comparative study. ACM Comput. Surv., 21(4):515-556, 1989.
2. A. V. Aho, Y. Sagiv, and J. D. Ullman. Equivalences among relational expressions. Siam Journal of Computing, 1979.
3. E. Bertino, S. Jajodia, and P. Samarati. A flexible authorization mechanism for relational data management systems. ACM Trans. Inf. Syst., 1999.
4. S. Castano, M. Fugini, G. Martella, and P. Samarati. Database Security. Addison Wesley, 1995.
5. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. In STOC, 1977.
6. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Toward privacy in public databases. In TCC, 2005.
7. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In ICDT, 1997.
8. N. Dalvi, G. Miklau, and D. Suciu. Asymptotic conditional probabilities for conjunctive queries. In ICDT, 2005.
9. A. Deutsch and Y. Papakonstantinou. Privacy in database publishing. In ICDT, 2005.
10. Simson Garfinkel. Database nation: the death of privacy in the 21st century. O'Reilly & Associates, Inc., Sebastopol, CA, USA, 2001.
11. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural csp decomposition methods. Artif. Intell., 2000.
12. P. P. Griffiths and B. W. Wade. An authorization mechanism for a relational database system. ACM Trans. Database Syst., 1(3), 1976.
13. K. Kenthapadi, N. Mishra, and K. Nissim. Simulatable auditing. In PODS, 2005.
14. A. Klug. On conjunctive queries containing inequalities. Journal of the ACM, 35(1):146-160, 1988.
15. P. Kolaitis, D. L. Martin, and M. N. Thakur. On the complexity of the containment problem for conjunctive queries with built-in predicates. In PODS, 1998.
16. P. Kolaitis and M. Vardi. Conjunctive-query containment and constraint satisfaction. In PODS, 1998.
17. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In ICDE, 2006.
18. G. Miklau and D. Suciu. A formal analysis of information disclosure in data exchange. In SIGMOD, 2004.
19. X. Qian. Query folding. In ICDE, 1996.
20. Y. P. Saraiya. Polynomial-time program transformations in deductive databases. In PODS, 1990.
21. K. Stoffel and M. Studer. Provable data privacy. In DEXA, 2005.
22. L. Sweeney. k-anonymity: a model for protecting privacy. IJUFKS, 10(5):557-570, 2002.
23. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. JCSS, 54(1), 1997.
24. M. Yannakakis. Algorithms for acyclic database schemes. In VLDB, 1981.
25. C. T. Yu and M. Z. Ozsoyoglu. An algorithm for tree-query membership of a distributed query. In IEEE COMPSAC, 1979.