dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

Secure Bufering in Firm Real-Time Database Systems.

Binto George, Jayant R. Haritsa: Secure Bufering in Firm Real-Time Database Systems. VLDB J. 8(3-4): 178-198(2000)
@article{DBLP:journals/vldb/GeorgeH00,
  author    = {Binto George and
               Jayant R. Haritsa},
  title     = {Secure Bufering in Firm Real-Time Database Systems},
  journal   = {VLDB J.},
  volume    = {8},
  number    = {3-4},
  year      = {2000},
  pages     = {178-198},
  ee        = {db/journals/vldb/GeorgeH00.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Many real-time database applications arise in electronic financial services, safety-critical installations and military systems where enforcing security is crucial to the success of the enterprise. We investigate here the performance implications, in terms of killed transactions, of guaranteeing multi-level secrecy in a real-time database system supporting applications with firm deadlines. In particular, we focus on the buffer management aspects of this issue.

Our main contributions are the following. First, we identify the importance and difficulties of providing secure buffer management in the real-time database environment. Second, we present SABRE, a novel buffer management algorithm that provides covert-channel-free security. SABRE employs a fully dynamic one-copy allocation policy for efficient usage of buffer resources. It also incorporates several optimizations for reducing the overall number of killed transactions and for decreasing the unfairness in the distribution of killed transactions across security levels. Third, using a detailed simulation model, the real-time performance of SABRE is evaluated against unsecure conventional and real-time buffer management policies for a variety of security-classified transaction workloads and system configurations. Our experiments show that SABRE provides security with only a modest drop in real-time performance. Finally, we evaluate SABRE's performance when augmented with the GUARD adaptive admission control policy. Our experiments show that this combination provides close to ideal fairness for real-time applications that can tolerate covert-channel bandwidths of up to one bit per second (a limit specified in military standards).

Key Words

Real-time database - Covert channels - Buffer management - Firm deadlines

Copyright © 2000 by Springer, Berlin, Heidelberg. Permission to make digital or hard copies of the abstract is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice along with the full citation.


Online Edition (Springer)

Citation Page

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 5 Issue 2, JACM, VLDB-J, POS, ..." and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...

References

[1]
Robert K. Abbott, Hector Garcia-Molina: Scheduling Real-Time Transactions: A Performance Evaluation. ACM Trans. Database Syst. 17(3): 513-560(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
...
[3]
Michael J. Carey, Rajiv Jauhari, Miron Livny: Priority in DBMS Resource Scheduling. VLDB 1989: 397-410 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
Silvana Castano, Maria Grazia Fugini, Giancarlo Martella, Pierangela Samarati: Database Security. Addison-Wesley & ACM Press 1995, ISBN 0-201-59375-0
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
Hong-Tai Chou, David J. DeWitt: An Evaluation of Buffer Management Strategies for Relational Database Systems. VLDB 1985: 127-141 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
...
[7]
Wolfgang Effelsberg, Theo Härder: Principles of Database Buffer Management. ACM Trans. Database Syst. 9(4): 560-595(1984) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
...
[10]
Binto George, Jayant R. Haritsa: Secure Transaction Processing in Firm Real-Time Database Systems. SIGMOD Conference 1997: 462-473 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
...
[12]
...
[13]
Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
...
[15]
Theo Härder: Observations on optimistic concurrency control schemes. Inf. Syst. 9(2): 111-120(1984) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
...
[17]
...
[18]
Thomas F. Keefe, Wei-Tek Tsai, Jaideep Srivastava: Multilevel Secure Database Concurrency Control. ICDE 1990: 337-344 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[19]
...
[20]
...
[21]
Butler W. Lampson: A Note on the Confinement Problem. Commun. ACM 16(10): 613-615(1973) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[22]
...
[23]
...
[24]
C. L. Liu, James W. Layland: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM 20(1): 46-61(1973) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[25]
Lui Sha, Ragunathan Rajkumar, John P. Lehoczky: Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Trans. Computers 39(9): 1175-1185(1990) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[26]
...
[27]
Özgür Ulusoy: Research Issues in Real-Time Database Systems. Inf. Sci. 87(1-3): 123-151(1995) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[28]
...
[29]
Hartmut Wedekind, Georg Zörntlein: Prefetching in Realtime Database Applications. SIGMOD Conference 1986: 215-226 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Last update Fri Sep 14 18:29:13 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page