Abstract
We consider the problem of answering queries against an \(\mathcal{EL}\) knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We provide a polynomial time algorithm that, given an \(\mathcal{EL}\) KB Σ, a set \(\mathbb{S}\) of secrets to be protected and a query q, outputs “Yes” whenever \(\Sigma \vDash q\) and the answer to q, together with the answers to any previous queries answered by the KB, does not allow the querying agent to deduce any of the secrets in \(\mathbb{S}\). This approach allows more flexible information sharing than is possible with traditional access control mechanisms.
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
Preview
Unable to display preview. Download preview PDF.
References
Bao, J., Slutzki, G., Honavar, V.: Privacy-preserving reasoning on the semantic web. In: Web Intelligence, pp. 791–797. IEEE Computer Society Press, Los Alamitos (2007)
Baader, F.: Terminological cycles in a description logic with existential restrictions. In: IJCAI’03: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 325–330. Morgan Kaufmann Publishers Inc., San Francisco (2003)
Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, gci axioms, and - what else? In: de Mántaras, R.L., Saitta, L. (eds.) ECAI, pp. 298–302. IOS Press, Amsterdam (2004)
Krisnadhi, A., Lutz, C.: Data complexity in the el family of dls. In: Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Turhan, A.-Y., Tessaris, S. (eds.) Description Logics, CEUR Workshop Proceedings, vol. 250. CEUR-WS.org (2007)
Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. J. of the Amer. Med. Informatics Assoc. (2000)
Rector, A., Horrocks, I.: Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In: Proceedings of the Workshop on Ontological Engineering, AAAI Spring Symposium (AAAI’97), Stanford, CA, pp. 321–325 (1997)
Tao, J., Slutzki, G., Honavar, V.: Secrecy-preserving query answering in el. Technical Report TR10-03a, Iowa State University, Ames, IA (2010)
Farkas, C., Brodsky, A., Jajodia, S.: Unauthorized inferences in semistructured databases. Information Sciences 176, 3269–3299 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tao, J., Slutzki, G., Honavar, V. (2010). Secrecy-Preserving Query Answering for Instance Checking in \(\mathcal{EL}\) . In: Hitzler, P., Lukasiewicz, T. (eds) Web Reasoning and Rule Systems. RR 2010. Lecture Notes in Computer Science, vol 6333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15918-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-15918-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15917-6
Online ISBN: 978-3-642-15918-3
eBook Packages: Computer ScienceComputer Science (R0)