ACM Home Page
Please provide us with feedback. Feedback
An efficient multiversion algorithm for secure servicing of transaction reads
Full text PdfPdf (848 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 2nd ACM Conference on Computer and communications security table of contents
Fairfax, Virginia, United States
Pages: 118 - 125  
Year of Publication: 1994
ISBN:0-89791-732-4
Authors
Paul Ammann  Center For Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA
Sushil Jajodia  Center For Secure Information Systems and Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/191177.191201
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

AJ93
 
AJF93
Paul Ammann, Sushil Jajodia, and Phyllis Frankl. Globally consistent event ordering in one-directional distributed environments. Technical Report ISSE-TR-93-104, George Mason University, Fairfax, VA 22030, August 1993.
 
AJJ92
 
BHG87
 
BL76
D.E. Bell and L.J. LaPadula. Secure computer systems: Unified exposition and multics interpretation. Technical Report MTI't- 2997, The Mitre Corporation, Bedford, MA, March 1976.
 
CK93
 
CM92
 
Com83
Committee on Multilevel Data Management Security, Air Force Studies Board, National Research Council, Washington, DC. Multilevel Data Management Security, 1983.
 
Cos92
 
Den82
 
DoD85
DoD Computer Security Center. Trusted Computer System Evaluation Criteria, December 1985. DoD 5200.28-STD.
 
FM89
Judy Froscher and Cathy Meadows. Achieving a trusted database management system using parallelism. In C. Landwehr and S. Jajodia, editors, Database Security II: Status and Prospects, pages 151-160. North Holland, 1989.
HC86
 
Jae92
Frank Jaeckle. A two snapshot algorithm for concurrency control in secure multi-level databases. Master's thesis, George Mason University, 1992.
 
JK90
Sushil J ajodia and Boris Kogan. Transaction processing in multilevel-secure databases using replicated architecture. In Proceedings of the Symposium on Research in Security and Privacy, Oakland, CA, May 1990.
KJ90
 
KK92
 
KT90
T.F. Keefe and W.T. Tsai. Multiversion concurrency control for multilevel secure database systems. In Proceedings of the Symposium on Research in Security and Privacy, pages 369-383, Oakland, CA, May 1990.
 
Mav93
Padmaja Mavuluri. On the fly reading of entire databases. Master's thesis, George Mason University, 1993.
 
McD93
 
MJS91
John McDermott, Sushil Jajodia, and Ravi Sandhu. A single-level scheduler for the replicated architecture for multilevel-secure databases. In Seventh Annual Computer Security Application Conference, pages 2- 11, San Antonio, TX, December 1991.
MPL92
PMC+92
 
Pu86
Calton Pu. On-the-fly, incremental, consistent reading of entire databases. Algorithmica, 1(3):271-287, October 1986.


Collaborative Colleagues:
Paul Ammann: colleagues
Sushil Jajodia: colleagues