Concurrency control in trusted database management systems: a survey
ACM SIGMOD Record
Secure transaction management and query processing in multilevel secure database systems
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
An alternative approach to serialization of multilevel secure Transactions
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Rewriting Histories: Recovering from Malicious Transactions
Distributed and Parallel Databases - Security of data and transaction processing
Improving timeliness in real-time secure database systems
ACM SIGMOD Record
A nested transaction model for multilevel secure database management systems
ACM Transactions on Information and System Security (TISSEC)
Correctness Criteria for Multilevel Secure Transactions
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Advanced Transaction Processing in Multilevel Secure File Stores
IEEE Transactions on Knowledge and Data Engineering
Integrating Security and Real-Time Requirements Using Covert Channel Capacity
IEEE Transactions on Knowledge and Data Engineering
Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems
IEEE Transactions on Knowledge and Data Engineering
The freeze algorithms for concurrency control in secure real-time database systems
Data & Knowledge Engineering
An extended transaction model approach for multilevel secure transaction processing
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
| Hi-index | 0.00 |
This paper makes original contributions in two different areas related to the concurrency control in multilevel secure, multiversion databases. First, it explores the issue of correctness criteria that are weaker than one-copy serializability. The requirements for a weaker correctness criterion are that it should preserve database consistency in some meaningful way, and moreover, it should be implementable in a way that does not require the scheduler to be trusted. This paper proposes three different, increasingly stricter notions of serializability that can serve as substitutes for one-copy serializability. Second, it presents a multiversiontimestamping protocol that has several very desirable properties: It is secure, produces multiversion histories that are equivalent to one-serial histories in which transactions are placed in a timestamp order, avoids livelocks, and can be implemented using single-leveluntrusted schedulers.