Ensuring atomicity of multilevel transactions

Authors:
Paul Ammann;Sushil Jajodia;Indrakshi Ray
Affiliations:
Center for Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA;Center for Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA;Center for Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA
Venue:
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Year:
1996

Citing 9
Cited 0

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Using semantic knowledge of transactions to increase concurrency

ACM Transactions on Database Systems (TODS)
Maintaining multilevel transaction atomicity in MLS database systems with kernelized architecture

Results of the Sixth Working Conference of IFIP Working Group 11.3 on Database Security on Database security, VI : status and prospects: status and prospects
Formal aspects of concurrency control in long-duration transaction systems using the NT/PV model

ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database

ACM Transactions on Database Systems (TODS)
Correctness Criteria for Multilevel Secure Transactions

IEEE Transactions on Knowledge and Data Engineering
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A Multilevel Transaction Problem for Multilevel Secure Database Systems and Its Solution for the Replicated Architecture

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
A Model of Atomicity for Multilevel Transactions

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ensuring atomicity is a major outstanding problem with present methods of handling multilevel transactions. The chief difficulty is that a high section of a transaction may be unable to complete due to violations of the integrity constraints, and a rollback of sections can be exploited to implement a covert channel. We define a notion of semantic atomicity which guarantees that either all or none of the sections of a transaction are present in any history. The notion of correct executions in our model is based on semantic correctness - that is, maintenance of integrity constraints - rather than serializability. We give a method whereby the application developer can statically analyze the set of transactions in the application and determine if the set ensures semantic atomicity and other desirable properties.