We study information disclosure in Description Logic ontologies, in the spirit of Controlled Query Evaluation, where query answering is filtered through optimal censors maximizing answers while hiding data protected by a declarative policy. Previous works have considered limited forms of policy, typically constituted by conjunctive queries (CQs), whose answer must never be inferred by a user. Also, existing implementations adopt approximated notions of censors that might result too restrictive in the practice in terms of the amount of non-protected information returned to the users. In this paper we enrich the framework, by extending CQs in the policy with comparison predicates and introducing preferences between ontology predicates, which can be exploited to decide the portion of a secret that can be disclosed to a user, thus in principle augmenting the throughput of query answers. We show that answering CQs in our framework is first-order rewritable for DL-LiteA ontologies and safe policies, and thus in AC0 in data complexity. We also present some experiments on a popular benchmark, showing effectiveness and feasibility of our approach in a real-world scenario.
Controlled query evaluation over prioritized ontologies with expressive data protection policies / Cima, Gianluca; Lembo, Domenico; Marconi, Lorenzo; Rosati, Riccardo; Fabio Savo, Domenico. - 12922 LNCS:(2021), pp. 374-391. (Intervento presentato al convegno International Semantic Web Conference tenutosi a Virtual Event) [10.1007/978-3-030-88361-4_22].
Controlled query evaluation over prioritized ontologies with expressive data protection policies
Gianluca Cima
;Domenico Lembo;Lorenzo Marconi;Riccardo Rosati;
2021
Abstract
We study information disclosure in Description Logic ontologies, in the spirit of Controlled Query Evaluation, where query answering is filtered through optimal censors maximizing answers while hiding data protected by a declarative policy. Previous works have considered limited forms of policy, typically constituted by conjunctive queries (CQs), whose answer must never be inferred by a user. Also, existing implementations adopt approximated notions of censors that might result too restrictive in the practice in terms of the amount of non-protected information returned to the users. In this paper we enrich the framework, by extending CQs in the policy with comparison predicates and introducing preferences between ontology predicates, which can be exploited to decide the portion of a secret that can be disclosed to a user, thus in principle augmenting the throughput of query answers. We show that answering CQs in our framework is first-order rewritable for DL-LiteA ontologies and safe policies, and thus in AC0 in data complexity. We also present some experiments on a popular benchmark, showing effectiveness and feasibility of our approach in a real-world scenario.File | Dimensione | Formato | |
---|---|---|---|
Cima_postprint_Controlled-query_2021.pdf.pdf
accesso aperto
Note: DOI: 10.1007/978-3-030-88361-4_22
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Creative commons
Dimensione
404.93 kB
Formato
Adobe PDF
|
404.93 kB | Adobe PDF | |
Cima_Controlled-query_2021.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
387.39 kB
Formato
Adobe PDF
|
387.39 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.