Updating logical databases
Safety and translation of relational calculus
ACM Transactions on Database Systems (TODS)
Domain independence and the relational calculus
Acta Informatica
Data & Knowledge Engineering
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity Modeling in the MLS Relational Model
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Polyinstantation for Cover Stories
ESORICS '92 Proceedings of the Second European Symposium on Research in Computer Security
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Controlled query evaluation with open queries for a decidable relational submodel
Annals of Mathematics and Artificial Intelligence
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)
Data Privacy for $\mathcal{ALC}$ Knowledge Bases
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Inference control in logic databases as a constraint satisfaction problem
ICISS'07 Proceedings of the 3rd international conference on Information systems security
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Fragmentation and encryption to enforce privacy in data storage
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Theoretical Computer Science
Enforcing confidentiality and data visibility constraints: an OBDD approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Using SAT-Solvers to compute inference-proof database instances
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Inference-usability confinement by maintaining inference-proof views of an information system
International Journal of Computational Science and Engineering
An OBDD approach to enforce confidentiality and visibility constraints in data publishing
Journal of Computer Security - DBSec 2011
| Hi-index | 0.00 |
In a logical setting, consistency of a database instance with constraints is a fundamental requirement. We show how satisfaction of a set of constraints guarantees confidentiality of some information declared secret by a security policy --- albeit at the cost of some modified database entries. We identify a very general class of constraints for which this problem is effectively and in many cases efficiently solvable by means of an automatic procedure. A distance minimization ensures maximal availability of correct database entries.