Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Formal query languages for secure relational databases
ACM Transactions on Database Systems (TODS)
Minimal data upgrading to prevent inference and association attacks
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering queries without revealing secrets
ACM Transactions on Database Systems (TODS)
For unknown secrecies refusal is better than lying
Data & Knowledge Engineering
Data & Knowledge Engineering
Lying versus refusal for known potential secrets
Data Engineering
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Fundamentals of Database Systems
Fundamentals of Database Systems
Controlling FD and MVD Inferences in Multilevel Relational Database Systems
IEEE Transactions on Knowledge and Data Engineering
Foundations of Secure Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Secure Databases: Constraints, Inference Channels, and Monitoring Disclosures
IEEE Transactions on Knowledge and Data Engineering
Constraints, Inference Channels and Secure Databases
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
The inference problem: a survey
ACM SIGKDD Explorations Newsletter
Controlled Query Evaluation for Known Policies by Combining Lying and Refusal
Annals of Mathematics and Artificial Intelligence
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Confidentiality policies for controlled query evaluation
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Inference control in logic databases as a constraint satisfaction problem
ICISS'07 Proceedings of the 3rd international conference on Information systems security
Enforcing confidentiality in relational databases by reducing inference control to access control
ISC'07 Proceedings of the 10th international conference on Information Security
Hi-index | 0.00 |
Controlled query evaluation for logic-oriented information systems provides a model for the dynamic enforcement of confidentiality policies even if users are able to reason about a priori knowledge and the answers to previous queries. Previous foundational work simply assumes that the control mechanism can solve the arising entailment problems (no matter how complex they may be), and deals only with closed queries. In this paper, we overcome these limitations by refining the abstract model for appropriately represented relational databases. We identify a relational submodel where all instances share a fixed infinite Herbrand domain but have finite base relations, and we require finite and domain-independent query results. Then, via suitable syntactic restrictions on the policy and query languages, each entailment problem occurring in the framework can be equivalently expressed as a universal validity problem within the Bernays-Schönfinkel class, whose (known) decidability in the classical setting is extended to our framework. For both refusal and lying, we design and verify evaluation methods for open queries, exploiting controlled query evaluation of appropriate sequences of closed queries, which include answer completeness tests.