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 study query answering over all possible optimal censors. We establish data complexity of this problem for ontologies specified in the Description Logics DL-LiteR and EL⊥ 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 proved through mutual reduction between CQE and CQA.

Revisiting Controlled Query Evaluation in Description Logics / Lembo, Domenico; Rosati, Riccardo; Savo, Domenico Fabio. - In: IJCAI. - ISSN 1045-0823. - (2019), pp. 1786-1792. (Intervento presentato al convegno International Joint Conference on Artificial Intelligence tenutosi a Macao; China).

Revisiting Controlled Query Evaluation in Description Logics

LEMBO, Domenico
;
ROSATI, Riccardo
;
2019

Abstract

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 study query answering over all possible optimal censors. We establish data complexity of this problem for ontologies specified in the Description Logics DL-LiteR and EL⊥ 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 proved through mutual reduction between CQE and CQA.
2019
International Joint Conference on Artificial Intelligence
data privacy; ontologies; consistent query answering; computational complexity of reasoning
04 Pubblicazione in atti di convegno::04c Atto di convegno in rivista
Revisiting Controlled Query Evaluation in Description Logics / Lembo, Domenico; Rosati, Riccardo; Savo, Domenico Fabio. - In: IJCAI. - ISSN 1045-0823. - (2019), pp. 1786-1792. (Intervento presentato al convegno International Joint Conference on Artificial Intelligence tenutosi a Macao; China).
File allegati a questo prodotto
File Dimensione Formato  
Lembo_Postprint_Revisiting-Controlled-Query_2019.pdf

accesso aperto

Note: https://www.ijcai.org/proceedings/2019/247
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 253.62 kB
Formato Adobe PDF
253.62 kB Adobe PDF
Lembo_Revisiting-Controlled-Query_2019.pdf

accesso aperto

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 147.38 kB
Formato Adobe PDF
147.38 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1276668
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 7
social impact