Safety and translation of relational calculus
ACM Transactions on Database Systems (TODS)
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences
Domain independence and the relational calculus
Acta Informatica
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Propositional belief base update and minimal change
Artificial Intelligence
Data & Knowledge Engineering
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
A Deduction Method Complete for Refutation and Finite Satisfiability
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Polyinstantation for Cover Stories
ESORICS '92 Proceedings of the Second European Symposium on Research in Computer Security
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
CL '00 Proceedings of the First International Conference on Computational Logic
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
An Authorization Model and Its Formal Semantics
ESORICS '98 Proceedings of the 5th European Symposium on Research in Computer Security
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Controlled Query Evaluation for Known Policies by Combining Lying and Refusal
Annals of Mathematics and Artificial Intelligence
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Database repairing using updates
ACM Transactions on Database Systems (TODS)
A formal analysis of information disclosure in data exchange
Journal of Computer and System Sciences
Controlled query evaluation with open queries for a decidable relational submodel
Annals of Mathematics and Artificial Intelligence
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Answering aggregate queries in data exchange
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database 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)
Simulatable Binding: Beyond Simulatable Auditing
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
Data Privacy for $\mathcal{ALC}$ Knowledge Bases
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Privacy-Preserving Query Answering in Logic-based Information Systems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Combining Consistency and Confidentiality Requirements in First-Order Databases
ISC '09 Proceedings of the 12th International Conference on Information Security
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Logic programs for consistently querying data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Consistent query answers in the presence of universal constraints
Information Systems
Restoring compromised privacy in micro-data disclosure
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Keep a few: outsourcing data while maintaining confidentiality
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
ICDT'07 Proceedings of the 11th international conference on Database Theory
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
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
The model evolution calculus with equality
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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
Inference-Proof view update transactions with minimal refusals
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
An OBDD approach to enforce confidentiality and visibility constraints in data publishing
Journal of Computer Security - DBSec 2011
Dynamic policy adaptation for inference control of queries to a propositional information system
Journal of Computer Security - DBSec 2011
| Hi-index | 5.23 |
This article introduces and investigates a new model-theoretic mechanism to enforce confidentiality (or privacy) requirements in a database instance; at the same time it ensures maximum availability of correct database answers. The aim is to materialize and publish a secure view that satisfies the properties of ''inference-proofness'' and ''distortion minimality''. A comprehensive class of first-order constraints (representing a user's a priori knowledge and a confidentiality policy) can be handled by the presented algorithm in a sound and complete way: tuple-generating dependencies, denial constraints and existential constraints. The due proof of refutation soundness makes use of Herbrand's theorem and semantic trees.