An extended transaction model approach for multilevel secure transaction processing

Authors:
Vijayalakshmi Atluri;Ravi Mukkamala
Affiliations:
MSIS Department and CIMIC, Rutgers University, Newark, NJ;Department of Computer Science Old Dominion University, Norfolk, VA
Venue:
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
Year:
2001

Citing 9
Cited 0

A model for concurrency in nested transactions systems

Journal of the ACM (JACM)
ACTA: a framework for specifying and reasoning about transaction structure and behavior

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Simple rational guidance for chopping up transactions

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Database transaction models for advanced applications

Database transaction models for advanced applications
Orange locking: channel-free database concurrency control via locking

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
Advanced Transaction Processing in Multilevel Secure File Stores

IEEE Transactions on Knowledge and Data Engineering
ASEP: A Secure and Flexible Commit Protocol for MLS Distributed Database Systems

IEEE Transactions on Knowledge and Data Engineering
Alternative Correctness Criteria for Concurrent Execution of Transactions in Multilevel Secure Databases

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
A semantic-based transaction processing model for multilevel transactions[1]An earlier version of this paper appeared in IEEE Symposium on Security and Privacy, Oakland, CA, May 1996, pp. 74-84.

Journal of Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multilevel secure transaction processing has been well explored in the past decade. Despite this research, the proposed secure concurrency control protocols are not completely satisfactory because of the stringent constraints imposed by multilevel security. In this paper, we argue that modeling a transaction as an extended transaction model could significantly reduce the performance penalty. We accomplish this by minimizing (1) the probability of restarting a high security level transaction; and (2) the portion of the transaction to be reexecuted, when a restart becomes inevitable. In particular, we exploit the non-flat nature of transactions by identifying dependencies among various components of a transaction and portraying a transaction as an advanced transaction model. We demonstrate, via formal proofs, that our approach preserves the semantics of the transaction, and our concurrency control algorithm guarantees serializability.