Abstract
Controlled query evaluation enforces security policies for confidentiality in information systems. It deals with users who may apply background knowledge to infer additional information from the answers to their queries. For each query the correct answer is first judged by some censor and then - if necessary - appropriately modified to preserve security. In previous approaches, modification has been done uniformly, either by lying or by refusal. A drawback of lying is that all disjunctions of secrets must always be protected. On the other hand, refusal may hide an answer even when the correct answer does not immediately reveal a secret. In this paper we introduce a hybrid answer modification method that appropriately combines lying and refusal. We prove that the new method is secure under the models of known potential secrets and of known secrecies, respectively. Furthermore, we demonstrate that the combined approach can be more cooperative than uniform lies and uniform refusal, and enjoyes the advantages of both.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2004-75

BibTeX:

@article{REWERSE-RP-2004-75,
	author = {Joachim Biskup and Piero A. Bonatti},
	title = {Controlled Query Evaluation for Known Policies by Combining Lying and Refusal},
	journal = {Annals of Mathematics and Artificial Intelligence},
	year = {2004},
	volume = {40},
	number = {1-2},
	pages = {37--62},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2004-75}
}