Data Privacy for $\mathcal{ALC}$ Knowledge Bases

  • Authors:
  • Phiniki Stouppa;Thomas Studer

  • Affiliations:
  • Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland CH-3012;Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland CH-3012

  • Venue:
  • LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 public views and some additional general background knowledge. We study the problem of provable privacy in the context of $\mathcal{ALC}$ knowledge bases. First we show that the $\mathcal{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.