Inference Channel-Free Integrity Constraints in Multilevel Relational Databases

Authors:
Xiolei Qian
Affiliations:
-
Venue:
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Year:
1994

Citing 0
Cited 6

Formal query languages for secure relational databases

ACM Transactions on Database Systems (TODS)
Static detection of security flaws in object-oriented databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A MAC Policy Framework for Multilevel Relational Databases

IEEE Transactions on Knowledge and Data Engineering
A Semantic Framework of the Multilevel Secure Relational Model

IEEE Transactions on Knowledge and Data Engineering
The non-primitiveness of the simple-security property and its non-applicability to relational databases

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
A systematic literature review of inference strategies

International Journal of Information and Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multilevel relational database with tuple-!evel labeling is a relational database together with a mapping, which associates a set of levels in a security lattice with every tuple in every relation in the database. Integrity constraints represent the invariant properties of data in amultilevel relational database. We study the relationship between integrity and secrecy, and showthat they are not necessarily in fundamental conflict. We identify common classes of constraints whose enforcement is free of both static and dynamic inference channels. We also extend the integrity checking mechanism by proper update semantics to remove dynamicinference channels in the enforcement of more general classes of constraints.