Privacy in Database Publishing

  • Alin Deutsch
  • Yannis Papakonstantinou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3363)

Abstract

We formulate and study a privacy guarantee to data owners, who share information with clients by publishing views of a proprietary database. The owner identi.es the sensitive proprietary data using a secret query against the proprietary database. Given an extra view, the privacy guarantee ensures that potential attackers will not learn any information about the secret that could not already be obtained from the existing views. We de.ne “learning” as the modi.cation of the attacker’s a-priori probability distribution on the set of possible secrets. We assume arbitrary a-priori distributions (including distributions that correlate the existence of particular tuples) and solve the problem when secret and views are expressed as unions of conjunctive queries with non-equalities, under integrity constraints. We consider guarantees (a) for given view extents (b) for given domain of the secret and (c) independent of the domain and extents.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Kanellakis, P., Grahne, G.: On the representation and querying of sets of possible worlds. Theoretical Computer Science 78, 159–187 (1991)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  3. 3.
    Bielecki, M., Van den Bussche, J.: Database interrogation using conjunctive queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 256–266. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Lossless regular views. In: Symposium on Principles of Database Systems (PODS 2002), pp. 247–258 (2002)Google Scholar
  5. 5.
    Deutsch, A., Tannen, V.: XML Queries and Constraints, Containment and Reformulation. To appear in J. Theoretical Computer Science, TCS (2005)Google Scholar
  6. 6.
    Deutsch, A., Papakonstantinou, Y.: Privacy in Database Publishing. Technical report, Department of Computer Science and Engineering, UCSD (2004); Extended version of this paper, Available from, http://www.db.ucsd.edu
  7. 7.
    Deutsch, A., Sui, L., Vianu, V.: Queryies determined by views (2004), Manuscript Available from http://www.db.ucsd.edu/people/alin/papers/QdV.ps
  8. 8.
    Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive query plans for data integration. Journal of Logic Programming 43(1), 49–73 (2000)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: PODS (2003)Google Scholar
  11. 11.
    Grahne, G., Mendelzon, A.O.: Tableau techniques for querying information sources through global schemas. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 332–347. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  12. 12.
    Halevy, A.: Logic-based techniques in data integration. Logic Based Artificial Intelligence (2000)Google Scholar
  13. 13.
    Miklau, G., Suciu, D.: Cryptographically enforced conditional access for xml. In: WebDB (2002)Google Scholar
  14. 14.
    Miklau, G., Suciu, D.: Controlling access to published data using cryptography. In: VLDB (2003)Google Scholar
  15. 15.
    Miklau, G., Suciu, D.: A formal analysis of information disclosure in data exchange. In: SIGMOD Conf. (2004)Google Scholar
  16. 16.
    Rizvi, S., Mendelzon, A.O., Sudarshan, S., Roy, P.: Extending query rewriting techniques for fine-grained access control. In: SIGMOD Conf. (2004)Google Scholar
  17. 17.
    Spiegel, M.R., Schiller, J.J., Alu Srinivasan, R.: Schaum’s Outline of Probability and Statistics. McGraw-Hill, New York (2000)Google Scholar
  18. 18.
    Ullman, J.D.: Information integration using logical views. In: Proceedings of the Sixth International Conference on Database Theory (1997)Google Scholar
  19. 19.
    Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica 23, 325–356 (1986)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Winslett, et al.: The TrustBuilder Project. Publications. Available from, http://drl.cs.uiuc.edu/security/pubs.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alin Deutsch
    • 1
  • Yannis Papakonstantinou
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of CaliforniaSan Diego

Personalised recommendations