Lisp and Symbolic Computation
On the increasing importance of constraints
RBAC '99 Proceedings of the fourth ACM workshop on Role-based access control
Role-based authorization constraints specification
ACM Transactions on Information and System Security (TISSEC)
Lying versus refusal for known potential secrets
Data Engineering
The inference problem: a survey
ACM SIGKDD Explorations Newsletter
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Principles of Constraint Programming
Principles of Constraint Programming
On finding an inference-proof complete database for controlled query evaluation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Controlled query evaluation with open queries for a decidable relational submodel
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Preprocessing for controlled query evaluation with availability policy
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
Combining Consistency and Confidentiality Requirements in First-Order Databases
ISC '09 Proceedings of the 12th International Conference on Information Security
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Inference-usability confinement by maintaining inference-proof views of an information system
International Journal of Computational Science and Engineering
Practical template-algebraic side channel attacks with extremely low data complexity
Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy
Hi-index | 0.00 |
We investigate inference control in logic databases. The administrator defines a confidentiality policy, i. e., the pieces of information which may not be disclosed to a certain user. We present a static approach which constructs an alternative database instance in which the confidential information is replaced by harmless information. The construction is performed by the means of constraint programming: The task of finding an appropriate database instance is delegated to a hierarchical constraint solver. We compare this static approach to a dynamic inference control mechanism - Controlled Query Evaluation - investigated in earlier work, and we also point out possible extensions which make use of the various opportunities offered by hierarchical constraint solvers.