Abstract
Information systems support data privacy by granting access only to certain (public) views. The data privacy problem is to decide whether hidden (private) information may be inferred from the publicviews and some additional general background knowledge. We study the problem of provable privacy in the context of ALC knowledge bases. First we show that the ALC privacy problem wrt. concept retrieval and subsumption queries is ExpTime-complete. Then we provide a sufficient condition for data privacy that can be checked in PTime. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Stouppa, P., & Studer, T. (2009). Data privacy for ALC knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5407 LNCS, pp. 409–421). https://doi.org/10.1007/978-3-540-92687-0_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
