Skip to main content

Privacy in Database Publishing

  • Conference paper
Database Theory - ICDT 2005 (ICDT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3363))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Kanellakis, P., Grahne, G.: On the representation and querying of sets of possible worlds. Theoretical Computer Science 78, 159–187 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Deutsch, A., Tannen, V.: XML Queries and Constraints, Containment and Reformulation. To appear in J. Theoretical Computer Science, TCS (2005)

    Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  10. Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: PODS (2003)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  12. Halevy, A.: Logic-based techniques in data integration. Logic Based Artificial Intelligence (2000)

    Google Scholar 

  13. Miklau, G., Suciu, D.: Cryptographically enforced conditional access for xml. In: WebDB (2002)

    Google Scholar 

  14. Miklau, G., Suciu, D.: Controlling access to published data using cryptography. In: VLDB (2003)

    Google Scholar 

  15. Miklau, G., Suciu, D.: A formal analysis of information disclosure in data exchange. In: SIGMOD Conf. (2004)

    Google Scholar 

  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. Spiegel, M.R., Schiller, J.J., Alu Srinivasan, R.: Schaum’s Outline of Probability and Statistics. McGraw-Hill, New York (2000)

    Google Scholar 

  18. Ullman, J.D.: Information integration using logical views. In: Proceedings of the Sixth International Conference on Database Theory (1997)

    Google Scholar 

  19. Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica 23, 325–356 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  20. Winslett, et al.: The TrustBuilder Project. Publications. Available from, http://drl.cs.uiuc.edu/security/pubs.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deutsch, A., Papakonstantinou, Y. (2004). Privacy in Database Publishing. In: Eiter, T., Libkin, L. (eds) Database Theory - ICDT 2005. ICDT 2005. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30570-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30570-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24288-8

  • Online ISBN: 978-3-540-30570-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics