Source Information Disclosure in Ontology-Based Data Integration

Ontology-based data integration systems allow users to effectively access data sitting in multiple sources by means of queries over a global schema described by an ontology. In practice, datasources often contain sensitive information that the data owners want to keep inaccessible to users. In this paper, we formalize and study the problem of determining whether a given data integration system discloses a source query to an attacker. We consider disclosure on a particular dataset, and also whether a schema admits a dataset on which disclosure occurs. We provide lower and upper bounds on disclosure analysis, in the process introducing a number of techniques for analyzing logical privacy issues in ontology-based data integration.

[1]  Evgeny Kharlamov,et al.  Controlled Query Evaluation for Datalog and OWL 2 Profile Ontologies , 2015, IJCAI.

[2]  Evgeny Kharlamov,et al.  Controlled Query Evaluation over OWL 2 RL Ontologies , 2013, International Semantic Web Conference.

[3]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[4]  Alin Deutsch,et al.  Privacy in GLAV Information Integration , 2007, ICDT.

[5]  Magdalena Ortiz,et al.  Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates , 2016, IJCAI.

[6]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[7]  Reind P. van de Riet,et al.  Answering queries without revealing secrets , 1983, TODS.

[8]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[9]  Joachim Biskup,et al.  Controlled query evaluation for enforcing confidentiality in complete information systems , 2004, International Journal of Information Security.

[10]  Carsten Lutz,et al.  Mixing Open and Closed World Assumptionin Ontology-Based Data Access: Non-Uniform Data Complexity , 2012, Description Logics.

[11]  Jerzy Marcinkowski,et al.  All-Instances Termination of Chase is Undecidable , 2014, ICALP.

[12]  Boris Motik,et al.  Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies , 2013, J. Artif. Intell. Res..

[13]  Alin Deutsch,et al.  The chase revisited , 2008, PODS.

[14]  Thomas Studer,et al.  Censors for Boolean Description Logic , 2014, Trans. Data Priv..

[15]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[16]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[17]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[18]  Joachim Biskup,et al.  Keeping secrets in incomplete databases , 2007, International Journal of Information Security.

[19]  Marco Guarnieri,et al.  Optimal Security-Aware Query Processing , 2014, Proc. VLDB Endow..

[20]  Oded Shmueli,et al.  Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..

[21]  Frank Wolter,et al.  Games for query inseparability of description logic knowledge bases , 2016, Artif. Intell..

[22]  Dan Suciu,et al.  Asymptotic Conditional Probabilities for Conjunctive Queries , 2005, ICDT.

[23]  Michael Benedikt,et al.  Querying Visible and Invisible Information , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[24]  Sarit Kraus,et al.  Foundations of Secure Deductive Databases , 1995, IEEE Trans. Knowl. Data Eng..

[25]  Dan Suciu,et al.  Query-Based Data Pricing , 2015, J. ACM.

[26]  Holger Spakowski,et al.  Completeness for parallel access to NP and counting class separations , 2005, Ausgezeichnete Informatikdissertationen.

[27]  Carsten Lutz,et al.  Ontology-Mediated Queries with Closed Predicates , 2015, IJCAI.

[28]  Dan Suciu,et al.  A formal analysis of information disclosure in data exchange , 2004, SIGMOD '04.

[29]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[30]  Piero A. Bonatti,et al.  A Confidentiality Model for Ontologies , 2013, International Semantic Web Conference.

[31]  Bruno Marnette.  Tractable schema mappings under oblivious termination , 2010 .

[32]  Alberto O. Mendelzon,et al.  Authorization Views and Conditional Query Containment , 2005, ICDT.

[33]  Diego Calvanese,et al.  View-based query answering in Description Logics: Semantics and complexity , 2012, J. Comput. Syst. Sci..

[34]  Franz Baader,et al.  Query and Predicate Emptiness in Ontology-Based Data Access , 2016, J. Artif. Intell. Res..