Secrecy-Preserving Reasoning Over Entailment Systems: Theory and Applications







Deposit Papers 


Voutsadakis, George, Slutzki, Giora and Honavar, Vasant (2008) Secrecy-Preserving Reasoning Over Entailment Systems: Theory and Applications. Technical Report 1, Computer Science, Iowa State University.

Full text available as:Adobe PDF


Privacy, copyright, security and other concerns make it essential for many distributed web applications to support selective sharing of information while, at the same time, protecting sensitive knowledge. Secrecypreserving reasoning refers to the answering of queries against a knowledge base involving inference that uses sensitive knowledge without revealing it. We present a general framework for secrecy-preserving reasoning over arbitrary entailment systems. This framework enables reasoning with hierarchical ontologies, propositional logic knowledge bases (over arbitrary logics) and RDFS knowledge bases containing sensitive information that needs to be protected. We provide an algorithm that, given a knowledge base over an effectively enumerable entailment system, and a secrecy set over it, defines a maximally informative secrecypreserving reasoner. Secrecy-preserving mappings between knowledge bases that allow reusing reasoners across knowledge bases are introduced.

Keywords:secrecy-preserving reasoning, database security, controlled query evaluation, open world semantics
Subjects:Information Systems: GENERAL
ID code:00000601
Deposited by:George Voutsadakis on 11 June 2009
Alternative Locations:

Contact site administrator at: