Abstract
This paper presents a set of multilevel-secure optimistic concurrency control (MLS/OCC) scheme that has several desirable properties: If lower-level transactions were somehow allowed to continue with its execution in spite of the conflict of high-level transactions, covert timing channel-freeness would be satisfied. This sort of optimistic approach for conflict insensitiveness and the properties of non-blocking and deadlock freedom make the optimistic concurrency control scheme especially attractive to multilevel-secure transaction processing. Unlike pessimistic approaches, the MLS/OCC scheme never delays or rejects an operation submitted by a lower-level transaction which is passed the mandatory access control. Instead, the read and write operations are processed freely without updating the actual database. Therefore, it is reasonable to assert that MLS/OCC scheme is allowed to avoid the abort of lower-level transactions in order to close covert timing channel, nevertheless guaranteeing conflict-preserving serializability. The basic refinement philosophy for the solution on starvation problem is an incorporation of multiple versions of low-level datainto MLS/OCC. This kind of intelligent channel-free concurrency control scheme satisfies the B3 or higher level of the US TCSEC requirements.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kang, S., Moon, S.: Read-Down Conflict-Preserving Serializability as A Correctness Criterion for Multilevel-Secure Optimistic Concurrency Control: CSR/RD. Journal of System Architecture 46, 889–902 (2000)
Kung, H.T., Robinson, J.T.: On Optimistic Methods for Concurrency Control. ACM Trans. Database System 6(2), 213–226 (1981)
Keefe, T.F., Tsai, W.T.: Multiversion Concurrency Control for Secure Database Systems. In: Proc. IEEE Computer Society Symposium on Security and Privacy, May 1990, pp. 369–383 (1990)
McDermott, J., Jajodia, S.: Orange-Locking: Channel-Free Database Concurrency Control via Locking. In: Landwehr, C.E. (ed.) Database Security VI: Status and Prospects, pp. 262–274. North-Holland, Amsterdam (1993)
Carey, M., Stonebraker, M.: The Performance of Concurrency Control Algorithm for Database Management Systems. In: Proc. of the 10th VLDB Conf., pp. 107–118 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kang, S., Choi, YR. (2005). A Covert Timing Channel-Free Optimistic Concurrency Control Scheme for Multilevel Secure Database Management Systems. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_45
Download citation
DOI: https://doi.org/10.1007/11553939_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28896-1
Online ISBN: 978-3-540-31990-0
eBook Packages: Computer ScienceComputer Science (R0)