Concurrency control in trusted database management systems: a survey
ACM SIGMOD Record
An efficient multiversion algorithm for secure servicing of transaction reads
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Secure Concurrency Control in Firm Real-Time Database Systems
Distributed and Parallel Databases - Security of data and transaction processing
A nested transaction model for multilevel secure database management systems
ACM Transactions on Information and System Security (TISSEC)
The Partitioned Synchronization Rule for Planar Extendible Partial Orders
IEEE Transactions on Knowledge and Data Engineering
Fairness strategy for multilevel secure concurrency control protocol
ICISS'06 Proceedings of the Second international conference on Information Systems Security
| Hi-index | 0.00 |
We offer a concurrency control algorithm for replicated, secure, multi-level databases. In secure databases, single copy techniques can not avoid indirect channels withoutsubjecting high level transactions to starvation due to malicious low level processes. However, multi-version and replicated databases can avoid starvation problems without introducing indirect channels by maintaining stable copies of old low level data values for use by high level transactions. The algorithm presented here improves on two comparable techniques, a direct multi-version approach of Keefe and Tsai [10] and full replicationscheme of Jajodla and Kogan [9]. In the latter, each security level has a container that holds a copy of all lower level data. This paper shows that only a constant number of old copies - two, as it turns out - need be maintained. We argue correctness of our algorithmanddemonstrate that the algorithm is free of indirect channels andstarvation.