Secrecy-preserving query answering for instance checking in EL

Authors:
Jia Tao;Giora Slutzki;Vasant Honavar
Affiliations:
Iowa State University, Ames, IA;Iowa State University, Ames, IA;Iowa State University, Ames, IA
Venue:
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Year:
2010

Citing 3
Cited 0

Privacy-Preserving Reasoning on the SemanticWeb

WI '07 Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence
Terminological cycles in a description logic with existential restrictions

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Unauthorized inferences in semistructured databases

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 S of secrets to be protected and a query q, outputs "Yes" whenever Σ ⊧ 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 S. This approach allows more flexible information sharing than is possible with traditional access control mechanisms.