Secrecy-Preserving Query Answering in ELH Knowledge Bases

Gopalakrishnan Krishnaswamy Sivaprakasam, Giora Slutzki

2016

Abstract

In this paper we study Secrecy-Preserving Query Answering problem under Open World Assumption (OWA) for ELH Knowledge Bases (KBs). We employ two tableau procedures designed to compute some consequences of ABox (A) and TBox (T ) denoted by A∗ and T ∗ respectively. A secrecy set of a querying agent is subset S of A∗ ∪ T ∗ which the agent is not allowed to access. An envelope is a superset of the secrecy set which provides logical protection to the secrecy set against the reasoning of the querying agent. Once envelopes are computed, they are used to efficiently answer assertional and GCI queries without compromising the secret information in S. Answering GCI queries while preserving secrecy has not been studied in the current literature. When the querying agent asks a query q, the reasoner answers “Yes” if KB |= q and q does not belong to the envelopes; otherwise, the reasoner answers “Unknown”. Being able to answer “Unknown” plays a key role in protecting secrecy under OWA. Since we are not computing all the consequences of the KB, answers to the queries based on just A∗ and T ∗ could be erroneous. To fix this problem, we further augment our algorithms to make the query answering procedure foolproof.

References

  1. Bao, J., Slutzki, G., and Honavar, V. (2007). Privacypreserving reasoning on the semanticweb. In Web Intelligence, IEEE/WIC/ACM Conference,791-797 .
  2. Bienvenu, M., Ortiz, M., S?imkus, M., and Xiao, G. (2013). Tractable queries for lightweight description logics. In Proceedings of the Twenty-Third UJCAI,768-774 .
  3. Biskup, J. and Tadros, C. (2012). Revising belief without revealing secrets. In Foundations of Information and Knowledge Systems, pages 51-70. Springer.
  4. Biskup, J. and Weibert, T. (2008). Keeping secrets in incomplete databases. International Journal of Information Security, 7(3):199-217.
  5. Delaitre, V. and Kazakov, Y. (2009). Classifying E LH ontologies in sql databases. In OWLED.
  6. Kagal, L., Finin, T., and Joshi, A. (2003). A policy based approach to security for the semantic web. In International Semantic Web Conference, volume 2870, pages 402-418. Springer.
  7. Kazakov, Y., Krötzsch, M., and Simanc?ík, F. (2014). The incredible elk. JAR, 53(1):1-61.
  8. Lutz, C., Toman, D., and Wolter, F. (2008). Conjunctive query answering in E L using a database system.
  9. Tao, J., Slutzki, G., and Honavar, V. (2010). Secrecypreserving query answering for instance checking in E L. In Web Reasoning and Rule Systems, 195-203 .
  10. Tao, J., Slutzki, G., and Honavar, V. (2014). A conceptual framework for secrecy-preserving reasoning in knowledge bases. TOCL, 16(1):3.
Download


Paper Citation


in Harvard Style

Sivaprakasam G. and Slutzki G. (2016). Secrecy-Preserving Query Answering in ELH Knowledge Bases . In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-172-4, pages 149-159. DOI: 10.5220/0005709701490159


in Bibtex Style

@conference{icaart16,
author={Gopalakrishnan Krishnaswamy Sivaprakasam and Giora Slutzki},
title={Secrecy-Preserving Query Answering in ELH Knowledge Bases},
booktitle={Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2016},
pages={149-159},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005709701490159},
isbn={978-989-758-172-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Secrecy-Preserving Query Answering in ELH Knowledge Bases
SN - 978-989-758-172-4
AU - Sivaprakasam G.
AU - Slutzki G.
PY - 2016
SP - 149
EP - 159
DO - 10.5220/0005709701490159