1997
DOI: 10.1007/978-0-387-35167-4_6
|View full text |Cite
|
Sign up to set email alerts
|

Multilevel Secure Transaction Processing: Status and Prospects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
9
0

Year Published

2000
2000
2013
2013

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…In both 2PL and TO algorithms, whenever there is contention for the same data item by transactions executing at different security levels, a lower level transaction may be either delayed or suspended to ensure correct execution. In such a scenario, two colluding transactions executing at high and low security levels can establish an information flow channel from a high security level to a low security level by accessing the selected data item according to some agreed-upon code [12].…”
Section: Multilevel Secure Transaction Processingmentioning
confidence: 99%
“…In both 2PL and TO algorithms, whenever there is contention for the same data item by transactions executing at different security levels, a lower level transaction may be either delayed or suspended to ensure correct execution. In such a scenario, two colluding transactions executing at high and low security levels can establish an information flow channel from a high security level to a low security level by accessing the selected data item according to some agreed-upon code [12].…”
Section: Multilevel Secure Transaction Processingmentioning
confidence: 99%
“…Other secure schedulers such as secure represents its classification level. An MLS distributed database optimistic scheduler and secure timestamp ordering also management system (MLS/DDBMS) can be shared by users at exhibit this problem [3]. …”
mentioning
confidence: 99%
“…Conventional concurrency control algorithms such as two-phase locking are not suitable for multilevel secure databases based on kernelized architecture, because they introduce a timing channel between transactions of different security levels that have shared access to objects in the database [3]. For example, under two-phase locking, a low transaction is delayed when it requests access to a data item that is locked by a high transaction.…”
Section: Introductionmentioning
confidence: 98%
“…In addition, this concurrency control algorithm makes the database vulnerable to denial of service attacks. Secure versions of other concurrency control algorithms such as optimistic concurrency control and timestamp ordering also exhibit this problem [3].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation