Formal query languages for secure relational databases
- 1 December 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 19 (4), 626-662
- https://doi.org/10.1145/195664.195675
Abstract
The addition of stringent security specifications to the list of requirements for an application poses many new problems in DBMS design and implementation, as well as database design, use, and maintenance. Tight security requirements, such as those that result in silent masking of witholding of true information from a user or the introduction of false information into query answers, also raise fundamental questions about the meaning of the database and the semantics of accompanying query languages. In this paper, we propose a belief-based semantics for secure databases, which provides a semantics for databases that can “lie” about the state of the world, or about their knowledge about the state of the world, in order to preserve security. This kind of semantics can be used as a helpful retrofit for the proposals for a “multilevel secure” database model (a particularly stringent form of security), and may be useful for less restrictive security policies as well. We also propose a family of query languages for multilevel secure relational database applications, and base the semantics of those languages on our semantics for secure databases. Our query languages are free of the semantic problems associated with use of ordinary SQL in a multilevel secure context, and should be easy for users to understand and employ.Keywords
This publication has 10 references indexed in Scilit:
- A logic for reasoning about securityACM Transactions on Computer Systems, 1992
- Declarative foundations of secure deductive databasesLecture Notes in Computer Science, 1992
- A model of authorization for next-generation database systemsACM Transactions on Database Systems, 1991
- Set-oriented production rules in relational database systemsPublished by Association for Computing Machinery (ACM) ,1990
- Indefinite and maybe information in relational databasesACM Transactions on Database Systems, 1990
- The POSTGRES rule managerIEEE Transactions on Software Engineering, 1988
- Incomplete Information in Relational DatabasesJournal of the ACM, 1984
- Answering queries without revealing secretsACM Transactions on Database Systems, 1983
- Modal LogicPublished by Cambridge University Press (CUP) ,1980
- A lattice model of secure information flowCommunications of the ACM, 1976