Boyce-Codd normal form and object normal forms
Information Processing Letters
IEEE Transactions on Software Engineering
A taxonomy for secure object-oriented databases
ACM Transactions on Database Systems (TODS)
Computer security
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
Logical foundations of multilevel databases
Data & Knowledge Engineering
Answering queries without revealing secrets
ACM Transactions on Database Systems (TODS)
Data & Knowledge Engineering
Lying versus refusal for known potential secrets
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
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
Enforcing Confidentiality Constraints on Sensitive Databases with Lightweight Trusted Clients
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Combining fragmentation and encryption to protect privacy in data storage
ACM Transactions on Information and System Security (TISSEC)
Requirements and protocols for inference-proof interactions in information systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Keep a few: outsourcing data while maintaining confidentiality
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Efficient utilization of elliptic curve cryptosystem for hierarchical access control
Journal of Systems and Software
Efficient inference control for open relational queries
DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
Fuzzy Role-Based Access Control
Information Processing Letters
On the inference-proofness of database fragmentation satisfying confidentiality constraints
ISC'11 Proceedings of the 14th international conference on Information security
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
A generic approach for correcting access restrictions to a consequence
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Inference-usability confinement by maintaining inference-proof views of an information system
International Journal of Computational Science and Engineering
Some remarks on relational database schemes having few minimal keys
Conceptual Modelling and Its Theoretical Foundations
ACM Transactions on Database Systems (TODS)
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Secure Communication of Medical Information Using Mobile Agents
Journal of Medical Systems
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Secure Transmission of Mobile Agent in Dynamic Distributed Environments
Wireless Personal Communications: An International Journal
Letting keys and functional dependencies out of the bag
APCCM '13 Proceedings of the Ninth Asia-Pacific Conference on Conceptual Modelling - Volume 143
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 | 0.89 |
Considering relational databases, controlled query evaluation preserves confidentiality even under inferences but at the expense of efficiency. Access control, however, enables efficiently computable access decisions but cannot automatically assure confidentiality because of missing inference control. In this paper we investigate constraints sufficient to eliminate (nontrivial) inferences in relational databases with the objective of replacing controlled query evaluation by access control mechanisms under preservation of confidentiality.