Controlled Query Evaluation through Epistemic Dependencies (2405.02458v1)
Abstract: In this paper, we propose the use of epistemic dependencies to express data protection policies in Controlled Query Evaluation (CQE), which is a form of confidentiality-preserving query answering over ontologies and databases. The resulting policy language goes significantly beyond those proposed in the literature on CQE so far, allowing for very rich and practically interesting forms of data protection rules. We show the expressive abilities of our framework and study the data complexity of CQE for (unions of) conjunctive queries when ontologies are specified in the Description Logic DL-Lite_R. Interestingly, while we show that the problem is in general intractable, we prove tractability for the case of acyclic epistemic dependencies by providing a suitable query rewriting algorithm. The latter result paves the way towards the implementation and practical application of this new approach to CQE.
- Foundations of Databases. Addison Wesley Publ. Co., 1995.
- Pushing the ℰℒℰℒ\mathcal{EL}caligraphic_E caligraphic_L envelope. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI), pages 364–369, 2005.
- Computing compliant anonymisations of quantified ABoxes w.r.t. ℰℒℰℒ\mathcal{EL}caligraphic_E caligraphic_L policies. In Proc. of the 19th Int. Semantic Web Conf. (ISWC), volume 12506 of Lecture Notes in Computer Science, pages 3–20. Springer, 2020.
- On rules with existential variables: Walking the decidability line. Artif. Intell., 175(9-10):1620–1654, 2011.
- Controlled query evaluation for enforcing confidentiality in complete information systems. Int. J. Inf. Sec., 3(1):14–27, 2004.
- Keeping secrets in incomplete databases. Int. J. Inf. Sec., 7(3):199–217, 2008.
- Joachim Biskup. For unknown secrecies refusal is better than lying. Data and Knowledge Engineering, 33(1):1–23, 2000.
- A confidentiality model for ontologies. In Proc. of the 12th Int. Semantic Web Conf. (ISWC), pages 17–32, 2013.
- Controlled query evaluation in OWL 2 QL: A ”longest honeymoon” approach. In Proc. of the 21st Int. Semantic Web Conf. (ISWC), volume 12922 of Lecture Notes in Computer Science, pages 428–444. Springer, 2022.
- Piero A. Bonatti. A false sense of security. Artificial Intelligence, 310, 2022.
- A general datalog-based framework for tractable query answering over ontologies. J. of Web Semantics, 14:57–83, 2012.
- EQL-Lite: Effective first-order query processing in description logics. In Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI), pages 274–279, 2007.
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning, 39(3):385–429, 2007.
- Controlled query evaluation over prioritized ontologies with expressive data protection policies. In Proc. of the 20th Int. Semantic Web Conf. (ISWC), volume 12922 of Lecture Notes in Computer Science, pages 374–391. Springer, 2021.
- Epistemic integrity constraints for ontology-based data management. In Proc. of the 37th AAAI Conf. on Artificial Intelligence (AAAI), pages 2790–2797. AAAI Press, 2020.
- Controlled query evaluation over OWL 2 RL ontologies. In Proc. of the 12th Int. Semantic Web Conf. (ISWC), pages 49–65, 2013.
- Controlled query evaluation for datalog and OWL 2 profile ontologies. In Proc. of the 24th Int. Joint Conf. on Artificial Intelligence (IJCAI), pages 2883–2889, 2015.
- European Union. Regulation (EU) 2016/679 of the European Parliament and of the Council of 27 April 2016. Official J. of the European Union, L 119:48, 2016.
- Sound, complete and minimal UCQ-rewriting for existential rules. Semantic Web, 6(5):451–475, 2015.
- Revisiting controlled query evaluation in description logics. In Proc. of the 28th Int. Joint Conf. on Artificial Intelligence (IJCAI), pages 1786–1792, 2019.
- OWL 2 Web Ontology Language profiles (second edition). W3C Recommendation, World Wide Web Consortium, December 2012. Available at http://www.w3.org/TR/owl2-profiles/.
- Answering queries without revealing secrets. ACM Trans. on Database Systems, 8(1):41–59, 1983.
- Moshe Y. Vardi. The complexity of relational query languages. In Proc. of the 14th ACM SIGACT Symp. on Theory of Computing (STOC), pages 137–146, 1982.