Skip to main content
SpringerLink
Log in

Controlled Query Evaluation in OWL 2 QL: A “Longest Honeymoon” Approach

  • Conference paper
  • First Online:
The Semantic Web – ISWC 2022 (ISWC 2022)

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

Included in the following conference series:

Abstract

Controlled Query Evaluation (CQE) has been recently studied in the context of Semantic Web ontologies. The goal of CQE is concealing some query answers so as to prevent external users from inferring confidential information. In general, there exist multiple, mutually incomparable ways of concealing answers, and previous CQE approaches choose in advance which answers are visible and which are not. In this paper, instead, we study a dynamic CQE method, namely, we propose to alter the answer to the current query based on the evaluation of previous ones. We aim at a system that, besides being able to protect confidential data, is maximally cooperative, which intuitively means that it answers affirmatively to as many queries as possible; it achieves this goal by delaying answer modifications as much as possible. We also show that the behavior we get cannot be intensionally simulated through a static approach, independent of query history. Interestingly, for OWL 2 QL ontologies and policy expressed through denials, query evaluation under our semantics is first-order rewritable, and thus in AC\(^0\) in data complexity. This paves the way for the development of practical algorithms, which we also preliminarily discuss in the paper.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

    Other definitions of censors have been considered in the literature, for example in [15, 17]. Definition 1 is chosen because it yields several important properties, such as indistinguishability (cf. Sect. 6), and it has been thoroughly investigated in various settings (e.g., in [10, 11]).

  2. 2.

    Trivially, the empty set is a censor for any CQE instance \(\mathcal {E}\).

  3. 3.

    With \(\mathcal {Q}\circ \langle q_{n+1}\rangle \) we denote the sequence \(\langle q_1,\ldots ,q_n,q_{n+1}\rangle \).

References

  1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Benedikt, M., Cuenca Grau, B., Kostylev, E.V.: Logical foundations of information disclosure in ontology-based data integration. Artif. Intell. 262, 52–95 (2018)

    Article  MathSciNet  Google Scholar 

  3. Biskup, J.: For unknown secrecies refusal is better than lying. Data Knowl. Eng. 33(1), 1–23 (2000)

    Article  Google Scholar 

  4. Biskup, J., Bonatti, P.: Controlled query evaluation for enforcing confidentiality in complete information systems. Int. J. Inf. Secur. 3(1), 14–27 (2004). https://doi.org/10.1007/s10207-004-0032-1

    Article  Google Scholar 

  5. Biskup, J., Bonatti, P.A.: Controlled query evaluation for known policies by combining lying and refusal. Ann. Math. Artif. Intell. 40(1–2), 37–62 (2004)

    Article  MathSciNet  Google Scholar 

  6. 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  Google Scholar 

  7. Bonatti, P., et al.: CQE in OWL 2 QL: A “longest honeymoon” approach (extended version). arXiv:2207.11155 (2022)

  8. Bonatti, P.A., Sauro, L.: A confidentiality model for ontologies. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 17–32. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41335-3_2

    Chapter  Google Scholar 

  9. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reason. 39(3), 385–429 (2007)

    Article  MathSciNet  Google Scholar 

  10. Cima, G., Lembo, D., Marconi, L., Rosati, R., Savo, D.F.: Controlled query evaluation in ontology-based data access. In: Pan, J.Z., et al. (eds.) ISWC 2020. LNCS, vol. 12506, pp. 128–146. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-62419-4_8

    Chapter  Google Scholar 

  11. Cima, G., Lembo, D., Marconi, L., Rosati, R., Savo, D.F.: Controlled query evaluation over prioritized ontologies with expressive data protection policies. In: Hotho, A., et al. (eds.) ISWC 2021. LNCS, vol. 12922, pp. 374–391. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-88361-4_22

    Chapter  Google Scholar 

  12. Cima, G., Lembo, D., Marconi, L., Rosati, R., Savo, D.F., Sinibaldi, D.: Controlled query evaluation over ontologies through policies with numerical restrictions. In: Proceedings of AIKE 2021, pp. 33–36. IEEE (2021)

    Google Scholar 

  13. Cima, G., Lembo, D., Rosati, R., Savo, D.F.: Controlled query evaluation in description logics through instance indistinguishability. In: Proceedings of IJCAI 2020, pp. 1791–1797 (2020)

    Google Scholar 

  14. Cuenca Grau, B., Kharlamov, E., Kostylev, E.V., Zheleznyakov, D.: Controlled query evaluation over OWL 2 RL ontologies. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 49–65. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41335-3_4

    Chapter  Google Scholar 

  15. Cuenca Grau, B., Kharlamov, E., Kostylev, E.V., Zheleznyakov, D.: Controlled query evaluation for datalog and OWL 2 profile ontologies. In: Proceedings of IJCAI 2015, pp. 2883–2889 (2015)

    Google Scholar 

  16. Cuenca Grau, B., Kostylev, E.V.: Logical foundations of linked data anonymisation. J. Artif. Intell. Res. 64, 253–314 (2019)

    Article  MathSciNet  Google Scholar 

  17. Lembo, D., Rosati, R., Savo, D.F.: Revisiting controlled query evaluation in description logics. In: Proceedings of IJCAI 2019, pp. 1786–1792 (2019)

    Google Scholar 

  18. Lloyd, J.W.: Foundations of Logic Programming (Second, Extended). Springer, Heidelberg (1987). https://doi.org/10.1007/978-3-642-83189-8

    Book  MATH  Google Scholar 

  19. Motik, B., Cuenca Grau, B., Horrocks, I., Wu, Z., Fokoue, A., Lutz, C.: OWL 2 Web Ontology Language profiles (second edition). W3C Recommendation, W3C, December 2012. http://www.w3.org/TR/owl2-profiles/

  20. Motik, B., Fokoue, A., Horrocks, I., Wu, Z., Lutz, C., Cuenca Grau, B.: OWL Web Ontology Language profiles. W3C Recommendation, W3C, October 2009. http://www.w3.org/TR/owl-profiles/

  21. Studer, T.: No-go theorems for data privacy. CoRR, abs/2005.13811 (2020)

    Google Scholar 

  22. Studer, T., Werner, J.: Censors for boolean description logic. Trans. Data Privacy 7(3), 223–252 (2014)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was partly supported by the EU within the Horizon Europe Programme under the Glaciation project (ref. no. 101070141) and within the H2020 Programme - ERA-NET Cofund ICT-AGRI-FOOD under the ADCATER Project (ref. no. 862665).

Author information

Authors and Affiliations

  1. Università di Napoli Federico II, Naples, Italy

    Piero Bonatti & Luigi Sauro

  2. University of Bordeaux, CNRS, Bordeaux INP, LaBRI, Bordeaux, France

    Gianluca Cima

  3. Sapienza Università di Roma, Rome, Italy

    Domenico Lembo, Lorenzo Marconi & Riccardo Rosati

  4. Università degli Studi di Bergamo, Bergamo, Italy

    Domenico Fabio Savo

Authors
  1. Piero Bonatti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianluca Cima
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Domenico Lembo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lorenzo Marconi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Riccardo Rosati
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Luigi Sauro
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Domenico Fabio Savo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lorenzo Marconi .

Editor information

Editors and Affiliations

  1. University of Manchester, Manchester, UK

    Ulrike Sattler

  2. University of Chile, Santiago, Chile

    Aidan Hogan

  3. University of Cape Town, Cape Town, South Africa

    Maria Keet

  4. University of Bologna, Bologna, Italy

    Valentina Presutti

  5. Universidade Federal do Espírito Santo, Vitória, Brazil

    João Paulo A. Almeida

  6. National Institute of Informatics, Tokyo, Japan

    Hideaki Takeda

  7. Orange, Belfort, France

    Pierre Monnin

  8. Sapienza University of Rome, Rome, Italy

    Giuseppe Pirrò

  9. University of Bari, Bari, Italy

    Claudia d’Amato

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bonatti, P. et al. (2022). Controlled Query Evaluation in OWL 2 QL: A “Longest Honeymoon” Approach. In: Sattler, U., et al. The Semantic Web – ISWC 2022. ISWC 2022. Lecture Notes in Computer Science, vol 13489. Springer, Cham. https://doi.org/10.1007/978-3-031-19433-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19433-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19432-0

  • Online ISBN: 978-3-031-19433-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation