Controlled Query Evaluation over Prioritized Ontologies with Expressive Data Protection Policies

2021 ◽  
pp. 374-391
Author(s):  
Gianluca Cima ◽  
Domenico Lembo ◽  
Lorenzo Marconi ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo
Keyword(s):  
Data Protection ◽  
Query Evaluation ◽  
Controlled Query Evaluation

scholarly journals Controlled Query Evaluation over OWL 2 RL Ontologies

2013 ◽  
pp. 49-65 ◽  
Author(s):  
Bernardo Cuenca Grau ◽  
Evgeny Kharlamov ◽  
Egor V. Kostylev ◽  
Dmitriy Zheleznyakov
Keyword(s):  
Query Evaluation ◽  
Controlled Query Evaluation

scholarly journals Revisiting Controlled Query Evaluation in Description Logics

2019 ◽  
Author(s):  
Domenico Lembo ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo
Keyword(s):  
Private Information ◽  
Description Logics ◽  
Study Data ◽  
Query Answering ◽  
Query Evaluation ◽  
Data Complexity ◽  
Complexity Results ◽  
Controlled Query Evaluation ◽  
Consistent Query Answering ◽  
The Relationship

Controlled Query Evaluation (CQE) is a confidentiality-preserving framework in which private information is protected through a policy, and a (optimal) censor guarantees that answers to queries are maximized without violating the policy. CQE has been recently studied in the context of ontologies, where the focus has been mainly on the problem of the existence of an optimal censor. In this paper we instead consider query answering over all possible optimal censors. We study data complexity of this problem for ontologies specified in the Description Logics DL-LiteR and EL_bottom and for variants of the censor language, which is the language used by the censor to enforce the policy. In our investigation we also analyze the relationship between CQE and the problem of Consistent Query Answering (CQA). Some of the complexity results we provide are indeed obtained through mutual reduction between CQE and CQA.

scholarly journals Controlled Query Evaluation in Description Logics Through Instance Indistinguishability

2020 ◽  
Author(s):  
Gianluca Cima ◽  
Domenico Lembo ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo
Keyword(s):  
Description Logics ◽  
Privacy Preserving ◽  
Query Answering ◽  
Query Evaluation ◽  
Data Complexity ◽  
First Order ◽  
Complexity Results ◽  
Controlled Query Evaluation

We study privacy-preserving query answering in Description Logics (DLs). Specifically, we consider the approach of controlled query evaluation (CQE) based on the notion of instance indistinguishability. We derive data complexity results for query answering over DL-LiteR ontologies, through a comparison with an alternative, existing confidentiality-preserving approach to CQE. Finally, we identify a semantically well-founded notion of approximated query answering for CQE, and prove that, for DL-LiteR ontologies, this form of CQE is tractable with respect to data complexity and is first-order rewritable, i.e., it is always reducible to the evaluation of a first-order query over the data instance.

Controlled Query Evaluation in Ontology-Based Data Access

2020 ◽  
pp. 128-146
Author(s):  
Gianluca Cima ◽  
Domenico Lembo ◽  
Lorenzo Marconi ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo
Keyword(s):  
Data Access ◽  
Query Evaluation ◽  
Controlled Query Evaluation
Sign in / Sign up

Export Citation Format

Share Document