Tightly secure transaction scheduler in multi-level secure database management systems

In multi-level secure database management system (MLS/DBMS), every transaction and data has associated with a unique security. Concurrent transactions on MLS/DBMS potentially have conflicts while accessing the shared data. The conflicts result in some of the conflicting transactions to be delayed. If the delayed transactions have been cleared at low security level, an information may flow downward with the violation of security policy. This kind of communication channel is called covert channel. Several transaction scheduling schemes for solving the covert channel problem had been presented. Although they had solved the covert channel problem, unfortunately, they had left alone other kinds of security problems, such as the availability and the integrity problems. Since computer security consists of maintaining the confidentiality, the availability, and the integrity, an attempt to acquire every characteristic is necessary. Tightly secure transaction scheduler, presented in this paper, schedules concurrent transactions without loss of the characteristics of security. For the confidentiality and the availability, the philosophy of the scheduler is based on the concealment of uncommitted data. Besides, for the integrity, a trustworthiness together with a recentness of a data are considered for discriminating the appropriateness of the data.
Publisher
SPRINGER VERLAG KG
Issue Date
1995
Language
ENG
Citation

LECTURE NOTES IN COMPUTER SCIENCE, no.978, pp.512 - 521

Series/Report no.
Lecture Notes in Computer Science; Vol. 978
ISSN
0302-9743
URI
http://hdl.handle.net/10203/4879
Appears in Collection
KGSM-Journal Papers(저널논문)
  • Hit : 352
  • Download : 9
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0