Censors for Boolean Description Logic

Protecting different kinds of information has become an important area of research. One aspect is to provide effective means to avoid that secrets can be deduced from the answers of legitimate queries. In the context of atomic propositional databases several methods have been developed to achieve this goal. However, in those databases it is not possible to formalize structural information. Also they are quite restrictive with respect to the specification of secrets. In this paper we extend those methods to match the much greater expressive power of Boolean description logics. In addition to the formal framework, we provide a discussion of various kinds of censors and establish different levels of security they can provide.

[1]  Ian Horrocks,et al.  Privacy-Preserving Query Answering in Logic-based Information Systems , 2008, ECAI.

[2]  Carsten Lutz,et al.  A Tableau Decision Algorithm for Modalized ALC with Constant Domains , 2002, Stud Logica.

[3]  Carsten Lutz,et al.  Updating Description Logic ABoxes , 2006, KR.

[4]  Thomas Studer.  Privacy Preserving Modules for Ontologies , 2009, Ershov Memorial Conference.

[5]  Carsten Lutz,et al.  Temporal Description Logics: A Survey , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

[6]  Thomas Studer.  Justified Terminological Reasoning , 2011, Ershov Memorial Conference.

[7]  Franz Baader,et al.  LTL over description logic axioms , 2008, TOCL.

[8]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

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

[10]  Diego Calvanese,et al.  View-Based Query Answering over Description Logic Ontologies , 2008, KR.

[11]  Kilian Stoffel,et al.  Provable Data Privacy , 2005, DEXA.

[12]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

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

[14]  Joachim Biskup.  For unknown secrecies refusal is better than lying , 1999, Data Knowl. Eng..

[15]  Dan Suciu,et al.  A formal analysis of information disclosure in data exchange , 2007, J. Comput. Syst. Sci..

[16]  Maarten Marx,et al.  Handling Boolean ABoxes , 2003 .

[17]  Evgeny Kharlamov,et al.  Controlled Query Evaluation over Lightweight Ontologies , 2014, Description Logics.

[18]  Phiniki Stouppa,et al.  Data Privacy for Knowledge Bases , 2009, LFCS.

[19]  Werner Nutt,et al.  Basic Description Logics , 2003, Description Logic Handbook.

[20]  Joachim Biskup,et al.  Controlled query evaluation with open queries for a decidable relational submodel , 2007, Annals of Mathematics and Artificial Intelligence.

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

[22]  Anil Nerode,et al.  Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings , 1994, LFCS.

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

[24]  P. Stouppa,et al.  Data Privacy for ALC Knowledge Bases , 2007 .

[25]  Joachim Biskup,et al.  Controlled Query Evaluation for Known Policies by Combining Lying and Refusal , 2002, FoIKS.

[26]  Jie Bao,et al.  Privacy-Preserving Reasoning on the SemanticWeb , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).