Abstract
The work in this paper is motivated by a privacy scenario in which the identity of certain persons (represented as anonymous individuals) should be hidden. We assume that factual information about known individuals (i.e., individuals whose identity is known) and anonymous individuals is stored in an ABox and general background information is expressed in a TBox, where both the TBox and the ABox are publicly accessible. The identity problem then asks whether one can deduce from the TBox and the ABox that a given anonymous individual is equal to a known one. Since this would reveal the identity of the anonymous individual, such a situation needs to be avoided. We first observe that not all Description Logics (DLs) are able to derive any such equalities between individuals, and thus the identity problem is trivial in these DLs. We then consider DLs with nominals, number restrictions, or function dependencies, in which the identity problem is non-trivial. We show that in these DLs the identity problem has the same complexity as the instance problem. Finally, we consider an extended scenario in which users with different rôles can access different parts of the TBox and ABox, and we want to check whether, by a sequence of rôle changes and queries asked in each rôle, one can deduce the identity of an anonymous individual.
A. Nuradiansyah—Funded by DFG within the Research Training Group 1907 “RoSI”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
To distinguish user rôles from DL roles, we write them with “ô” and also denote specific such rôles with letters with a hat.
References
Baader, F., Borchmann, D., Nuradiansyah, A.: Preliminary results on the identity problem in description logic ontologies. In: Proceedings of the 30th International Workshop on Description Logics (2017)
Baader, F., Calvanese, D., McGuinness, D.L., Patel-Schneider, P.F., Nardi, D. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Baader, F., Horrocks, I., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)
Biskup, J., Bonatti, P.A.: Controlled query evaluation for enforcing confidentiality in complete information systems. Int. J. Inf. Sec. 3(1), 14–27 (2004)
Cook, S., Nguyen, P.: Logical Foundations of Proof Complexity, 1st edn. Cambridge University Press, New York (2010)
Gallier, J.: Logic for Computer Science: Foundations of Automatic Theorem Proving, 2nd edn. Dover (2015)
Grau, B.C.: Privacy in ontology-based information systems: a pending matter. Semant. Web 1, 137–141 (2010)
Grau, B.C., Horrocks, I.: Privacy-preserving query answering in logic-based information systems. In: Proceedings of the 18th European Conference on Artificial Intelligence, pp. 40–44 (2008)
Grau, B.C., Kostylev, E.V.: Logical foundations of privacy-preserving publishing of linked data. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 943–949. AAAI Press (2016)
Gutiérrez-Basulto, V., Jung, J.C., Lutz, C., Schröder, L.: Probabilistic description logics for subjective uncertainty. J. Artif. Intell. Res. (JAIR) 58, 1–66 (2017)
Hollunder, B., Baader, F.: Qualifying number restrictions in concept languages. In: Proceedings of the 2nd International Conference on the Principles of Knowledge Representation and Reasoning (KR 1991), pp. 335–346 (1991)
Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. J. Logic Lang. Inform. 14(3), 369–395 (2005)
Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. Computer 29(2), 38–47 (1996)
Schaerf, A.: Reasoning with individuals in concept languages. In: Torasso, P. (ed.) AI*IA 1993. LNCS, vol. 728, pp. 108–119. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-57292-9_49
Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI 1991), pp. 466–471 (1991)
Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with complements. Artif. Intell. 48(1), 1–26 (1991)
Stouppa, P., Studer, T.: A formal model of data privacy. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol. 4378, pp. 400–408. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70881-0_34
Stouppa, P., Studer, T.: Data privacy for \(\cal{ALC}\) knowledge bases. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 409–421. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92687-0_28
Sweeney, L.: K-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557–570 (2002)
Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. Artif. Intell. Res. 12, 199–217 (2000)
Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. CoRR, cs.LO/0106031, PhD thesis, RWTH Aachen (2001)
Toman, D., Weddell, G.: Conjunctive query answering in \({\cal{CFD}}_{nc}\): a PTIME description logic with functional constraints and disjointness. In: Cranefield, S., Nayak, A. (eds.) AI 2013. LNCS (LNAI), vol. 8272, pp. 350–361. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03680-9_36
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Baader, F., Borchmann, D., Nuradiansyah, A. (2017). The Identity Problem in Description Logic Ontologies and Its Application to View-Based Information Hiding. In: Wang, Z., Turhan, AY., Wang, K., Zhang, X. (eds) Semantic Technology. JIST 2017. Lecture Notes in Computer Science(), vol 10675. Springer, Cham. https://doi.org/10.1007/978-3-319-70682-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-70682-5_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70681-8
Online ISBN: 978-3-319-70682-5
eBook Packages: Computer ScienceComputer Science (R0)