Keeping Secrets in Modalized DL Knowledge Bases

Gopalakrishnan Krishnasamy Sivaprakasam, Giora Slutzki

Abstract

In this paper we study Secrecy-Preserving Query Answering problem under the Open World Assumption (OWA) for ELH Knowledge Bases. Here ELH is a top-free description logic ELH augmented with a modal operator ^. We employ a tableau procedure designed to compute a rooted labeled tree T which contains information about some assertional consequences of the given knowledge base. Given a secrecy set S, which is a finite set of assertions, we compute a function E, called an envelope of S, which assigns a set of assertions to each node of T. E provides logical protection to the secrecy set S against the reasoning of a querying agent. Once the tree T and an envelope E are computed, we define the secrecy-preserving tree TE. Based on the information available in TE, assertional queries with modal operator ^ can be answered efficiently while preserving secrecy. To the best of our knowledge, this work is first one studying secrecy-preserving reasoning in description logic augmented with modal operator ^. When the querying agent asks a query q, the reasoner answers “Yes” if information about q is available in TE; 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 knowledge base, answers to the queries based on just secrecy-preserving tree TE could be erroneous. To fix this problem, we further augment our algorithms by providing recursive query decomposition algorithm to make the query answering procedure foolproof.

References

  1. Barth, A. and Mitchell, J. C. (2005). Enterprise privacy promises and enforcement. In Proceedings of the 2005 workshop on Issues in the theory of security, pages 58-66. ACM.
  2. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., and Rosati, R. (2007). Tractable reasoning and efficient query answering in description logics: The dllite family. J. of Automated Reasoning, 39(3):385- 429.
  3. Halpern, J. Y. and O'Neill, K. R. (2005). Anonymity and information hiding in multiagent systems. Journal of Computer Security, 13(3):483-514.
  4. Hemaspaandra, E. (2000). The complexity of poor mans logic. In STACS 2000, pages 230-241. Springer.
  5. Jafari, M., Fong, P. W., Safavi-Naini, R., Barker, K., and Sheppard, N. P. (2011). Towards defining semantic foundations for purpose-based privacy policies. In Proceedings of the first ACM conference on Data and application security and privacy, pages 213-224. ACM.
  6. Kripke, S. A. (1963). Semantical analysis of modal logic 1 normal modal propositional calculi. Mathematical Logic Quarterly, 9(5-6):67-96.
  7. Krishnasamy Sivaprakasam, G. and Slutzki, G. (2016). Secrecy-preserving query answering in ELH knowledge bases. In ICAART.
  8. Lutz, C., Sturm, H., Wolter, F., and Zakharyaschev, M. (2001). Tableaux for temporal description logic with constant domains. In Automated Reasoning, pages 121-136. Springer.
  9. Tao, J., Slutzki, G., and Honavar, V. (2010). Secrecypreserving query answering for instance checking in EL. In Proceedings of Web Reasoning and Rule Systems, 195-203 .
  10. Tao, J., Slutzki, G., and Honavar, V. (2012). Pspace tableau algorithms for acyclic modalized ALC. Journal of Automated Reasoning, 49(4):551-582.
  11. Tao, J., Slutzki, G., and Honavar, V. (2014). A conceptual framework for secrecy-preserving reasoning in knowledge bases. TOCL, 16(1):3:1-3:32.
  12. Tsukada, Y., Mano, K., Sakurada, H., and Kawabe, Y. (2009). Anonymity, privacy, onymity, and identity: A modal logic approach. In Computational Science and Engineering, 2009. CSE'09. International Conference on, volume 3, pages 42-51. IEEE.
Download


Paper Citation


in Harvard Style

Krishnasamy Sivaprakasam G. and Slutzki G. (2017). Keeping Secrets in Modalized DL Knowledge Bases . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 591-598. DOI: 10.5220/0006202505910598


in Bibtex Style

@conference{icaart17,
author={Gopalakrishnan Krishnasamy Sivaprakasam and Giora Slutzki},
title={Keeping Secrets in Modalized DL Knowledge Bases},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={591-598},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006202505910598},
isbn={978-989-758-220-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Keeping Secrets in Modalized DL Knowledge Bases
SN - 978-989-758-220-2
AU - Krishnasamy Sivaprakasam G.
AU - Slutzki G.
PY - 2017
SP - 591
EP - 598
DO - 10.5220/0006202505910598