Secrecy-preserving Query Answering for Instance Checking in EL







Deposit Papers 


Tao, Jia (2010) Secrecy-preserving Query Answering for Instance Checking in EL. Technical Report TR10-03a, Computer Science, Iowa State University.

Full text available as:Adobe PDF

This is the latest version of this eprint.


We consider the problem of answering queries against a knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We study query answering against EL knowledge bases. We provide a polynomial time algorithm that, given an EL KB Sigma, a set S of secrets to be protected and a query q or the form C(a) or r(a,b), outputs ``Yes'' whenever Sigma entails 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.

Keywords:Description Logic, Secrecy, EL
Subjects:Computing Methodologies: ARTIFICIAL INTELLIGENCE: Knowledge Representation Formalisms and Methods (F.4.1)
ID code:00000649
Deposited by:Jia Tao on 21 July 2010

Available Versions of This Paper

Contact site administrator at: