An efficient multiversion algorithm for secure servicing of transaction reads

Authors:
Paul Ammann;Sushil Jajodia
Affiliations:
Center For Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA;Center For Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA
Venue:
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Year:
1994

Citing 13
Cited 2

Partitioned two-phase locking

ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Concurrency control in multilevel-secure databases based on replicated architecture

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Distributed timestamp generation in planar lattice networks

ACM Transactions on Computer Systems (TOCS)
Transaction management in replicated-architecture multilevel-secure database systems

Transaction management in replicated-architecture multilevel-secure database systems
Parallelism in relational data base systems: architectural issues and design approaches

DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Cryptography and data security

Cryptography and data security
Transaction Processing Using an Untrusted Scheduler in a Multilevel Database with Replicated Architecture

Results of the IFIP WG 11.3 Workshop on Database Security V: Status and Prospects
Maintaining Multilevel Transaction Atomicity in MLS Database Systems with Replicated Architecture

Proceedings of the IFIP WG11.3 Working Conference on Database Security VII
On Transaction Processing for Multilevel Secure Replicated Databases

ESORICS '92 Proceedings of the Second European Symposium on Research in Computer Security
A Two Snapshot Algorithm for Concurrency Control in Multi-Level Secure Databases

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
A Multilevel Transaction Problem for Multilevel Secure Database Systems and Its Solution for the Replicated Architecture

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy

A dual copy method for transaction separation with multiversion control for read-only transactions

Proceedings of the 2001 ACM symposium on Applied computing
A nested transaction model for multilevel secure database management systems

ACM Transactions on Information and System Security (TISSEC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an efficient multiversion algorithm for servicing read requests in secure multilevel databases. Rather than keep an arbitrary number of versions of a datum, as standard multiversion algorithms do, the algorithm presented here maintains only a small fixed number of versions—up to three—for a modified datum. Each version corresponds to the state of the datum at the end of an externally defined version period. The algorithm avoids both covert channels and starvation of high transactions, and applies to security structures that are arbitrary partial orders. The algorithm also offers long-read transactions at any security level conflict-free access to a consistent, though slightly dated, view of any authorized portion of the database. We derive constraints sufficient to guarantee one-copy serializability of executions histories, and then exhibit an algorithm that satisfies these constraints.