Skip to main content
SpringerLink
Log in

Confidentiality Preserving Evaluation of Open Relational Queries

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9282))

Abstract

Relational database systems may serve to evaluate an open query, returning a relation with all those tuples that satisfy the properties expressed in the query, complemented with an often implicit statement about the completeness of the result. Known inference control procedures for enforcing a confidentiality policy have to inspect by theorem-proving explicit completeness sentences expressed in first-order logic. Unfortunately, experiments indicate that standard theorem provers are not efficient enough to deal with completeness sentences of a larger size. We describe and evaluate approaches to overcome the performance issues by suitably transforming an original completeness sentence and by optimizing the number of prover calls with a completeness sentence involved.

This work has been partially supported by the Deutsche Forschungsgemeinschaft (German Research Council) under grant no. BI 311/12-2.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Notes

  1. 1.

    see Sect. 5.2 of [5].

  2. 2.

    http://www.eprover.org.

References

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

    MATH  Google Scholar 

  2. Biskup, J.: Inference control. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 600–605. Springer, Heidelberg (2011)

    Google Scholar 

  3. Biskup, J.: Inference-usability confinement by maintaining inference-proof views of an information system. Int. J. Comput. Sci. Eng. 7(1), 17–37 (2012)

    Article  MathSciNet  Google Scholar 

  4. Biskup, J.: Logic-oriented confidentiality policies for controlled interaction execution. In: Madaan, A., Kikuchi, S., Bhalla, S. (eds.) DNIS 2013. LNCS, vol. 7813, pp. 1–22. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Biskup, J., Bonatti, P.A.: Controlled query evaluation with open queries for a decidable relational submodel. Ann. Math. Artif. Intell. 50(1–2), 39–77 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Farkas, C., Jajodia, S.: The inference problem: a survey. SIGKDD Explor. 4(2), 6–11 (2002)

    Article  Google Scholar 

  7. Halpern, J.Y., O’Neill, K.R.: Secrecy in multiagent systems. ACM Trans. Inf. Syst. Secur. 12(1), 5.1–5.47 (2008)

    Article  Google Scholar 

  8. Levesque, H.J., Lakemeyer, G.: The Logic of Knowledge Bases. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  9. McCune, W.: Prover9 and Mace4 (2005–2010). http://www.cs.unm.edu/mccune/prover9/

  10. Sutcliffe, G.: The TPTP problem library and associated infrastructure: the FOF and CNF parts, v3.5.0. J. Autom. Reason. 43(4), 337–362 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Technische Universität Dortmund, Dortmund, Germany

    Joachim Biskup, Martin Bring & Michael Bulinski

Authors
  1. Joachim Biskup
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Bring
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Bulinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joachim Biskup .

Editor information

Editors and Affiliations

  1. Poznan University of Technology, Poznán, Poland

    Morzy Tadeusz

  2. INRIA, Montpellier, France

    Patrick Valduriez

  3. Teleport 2, LIAS/ISAE-ENSMA, Poitiers, France

    Ladjel Bellatreche

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Biskup, J., Bring, M., Bulinski, M. (2015). Confidentiality Preserving Evaluation of Open Relational Queries. In: Tadeusz, M., Valduriez, P., Bellatreche, L. (eds) Advances in Databases and Information Systems. ADBIS 2015. Lecture Notes in Computer Science(), vol 9282. Springer, Cham. https://doi.org/10.1007/978-3-319-23135-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23135-8_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23134-1

  • Online ISBN: 978-3-319-23135-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation