Security checking in relational database management systems augmented with inference engines
Computers and Security
Resolving the tension between integrity and security using a theorem prover
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Secure Query-Processing Strategies
Computer
Design of LDV: A Multilevel Secure Relational Database Management
IEEE Transactions on Knowledge and Data Engineering
Controlling FD and MVD Inferences in Multilevel Relational Database Systems
IEEE Transactions on Knowledge and Data Engineering
Inference in MLS Database Systems
IEEE Transactions on Knowledge and Data Engineering
Secure Databases: Constraints, Inference Channels, and Monitoring Disclosures
IEEE Transactions on Knowledge and Data Engineering
Enhancing the Controlled Disclosure of Sensitive Information
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
The inference problem: a survey
ACM SIGKDD Explorations Newsletter
Data Level Inference Detection in Database Systems
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
The inference problem and updates in relational databases
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
Inference aggregation detection in database management systems
SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
Controlling logical inference in multilevel database systems
SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
On tracker attacks in health grids
Proceedings of the 2006 ACM symposium on Applied computing
A systematic literature review of inference strategies
International Journal of Information and Computer Security
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
| Hi-index | 0.00 |
The Dynamic Disclosure Monitor (D2Mon) is a security mechanism that executes during query processing time to prevent sensitive data from being inferred. A limitation of D2Mon is that it unnecessarily examines the entire history database in computing inferences. In this paper, we present a process that can be used to reduce the number of tuples that must be examined in computing inferences during query processing time. In particular, we show how a priori knowledge of a database dependency can be used to reduce the search space of a relation when applying database dependencies. Using the database dependencies, we develop a process that forms an index table into the database that identifies those tuples that can be used in satisfying database dependencies. We show how this process can be used to extend D2Mon to reduce the number of tuples that must be examined in the history database when computing inferences. We further show that inferences that are computed by D2Mon using our extension are sound and complete.