Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ray, Indrakshi; 2 | Ammann, Paul; *; 3 | Jajodia, Sushil; 2
Affiliations: Information & Software Engineering Department, George Mason University, Fairfax, VA 22030, USA
Correspondence: [*] Corresponding author. Tel.: +1 703 993 1660; Fax: +1 703 993 1638; E-mail: pammann@gmu.edu.
Note: [1] An earlier version of this paper appeared in IEEE Symposium on Security and Privacy, Oakland, CA, May 1996, pp. 74–84.
Note: [2] The work of Sushil Jajodia and Indrakshi Ray was partially supported by National Security Agency under grants MDA904-96-1-0103 and MDA904-96-1-0104 and by US Air Force/Rome Labs under grant F30602-97-1-0139. The work of Indrakshi Ray was also partially supported by a George Mason University Fellowship Award.
Note: [3] The work of Paul Ammann was partially supported by US Air Force/Rome Labs under grants F30602-97-1-0139.
Abstract: Multilevel transactions have been proposed for multilevel secure databases; in contrast to most proposals, such transactions allow users to read and write across multiple security levels. The security requirement that no high level operation influence a low level operation often conflicts with the atomicity requirement of the standard transaction processing model. In particular, others have shown that no concurrency control algorithm based on the standard transaction processing model can guarantee both atomicity and security. This conflict motivates us to propose an alternative semantic-based transaction processing model for multilevel transactions. Our model uses the semantics of the application to analyze an application and reason about its behavior. Our notion of correctness is based on semantic correctness instead of serializability as in the standard transaction processing model. Semantic correctness ensures that database consistency is maintained, transactions output consistent data, and all partially executed transactions complete. We show how an example application can be analyzed to assure semantic correctness and how this analysis can be automated. We also propose a simple timestamp-based multiversion concurrency control algorithm for transaction processing on a kernelized architecture. The advantages of our model over the standard transaction processing model are that atomicity can be assessed, and for some applications ensured via off line analysis, more concurrency is achieved, lesser synchronization between security levels is required, and a larger class of multilevel transactions can be processed.
DOI: 10.3233/JCS-980108
Journal: Journal of Computer Security, vol. 6, no. 3, pp. 181-217, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl