Secrecy-preserving query answering for instance checking in EL

Jia Tao, Giora Slutzki, Vasant Honavar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations


We consider the problem of answering queries against an 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 EL KB ∑, a set of secrets to be protected and a query q, outputs "Yes" whenever 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 S. This approach allows more flexible information sharing than is possible with traditional access control mechanisms.

Original languageEnglish (US)
Title of host publicationWeb Reasoning and Rule Systems - Fourth International Conference, RR 2010, Proceedings
Number of pages9
StatePublished - 2010
Event4th International Conference on Web Reasoning and Rule Systems, RR 2010 - Bressanone/Brixen, Italy
Duration: Sep 22 2010Sep 24 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6333 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other4th International Conference on Web Reasoning and Rule Systems, RR 2010

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Secrecy-preserving query answering for instance checking in EL'. Together they form a unique fingerprint.

Cite this