Journal of Computer Security - Volume 4, issue 2-3

Authors: Jajodia, Sushil | Millen, Jonathan

Article Type: Editorial

DOI: 10.3233/JCS-1996-42-301

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 121-121, 1996

Authors: Shieh, Shiuh-Pyng | Gligor, Virgil D.

Article Type: Research Article

Abstract: In this paper we investigate the illicit means of leaking sensitive or private information in operating systems. The leakage cannot be eliminated either by the use of access control and authentication mechanisms or by administrative measures since unauthorized access need not be attempted. In order to resolve the problem, we designed an audit system which is able to detect the illicit leakage of information. This audit system consists of two major components: an enhanced audit-collection mechanism and an audit-analysis tool.

Keywords: Operating system security, multi-level secure systems, data transmission, information flow, audit collection, analysis

DOI: 10.3233/JCS-1996-42-302

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 123-148, 1996

Authors: Ammann, Paul | Sandhu, Ravi S. | Lipton, Richard

Article Type: Research Article

Abstract: Formal demonstration of equivalence or nonequivalence of different security models helps identify the fundamental constructs and principles in such models. In this paper, we demonstrate the nonequivalence of two monotonic access control models that differ only in the creation operation for new subjects and/or objects; in particular, we show that single-parent creation is less expressive than multi-parent creation. The nature of the proof indicates that this result will apply to any monotonic access control model. The nonequivalence proof is carried out on an abstract access control model, following which the results are interpreted in standard formulations. In particular, we apply …the results to demonstrate nonequivalence of the Schematic Protection Model (SPM) and the Extended Schematic Protection Model (ESPM). We also show how the results apply to the typed access matrix model (TAM), which is an extension of the well known access matrix model formalized by Harrison, Ruzzo and Ullman (HRU). The results in this paper offer theoretical justification for regarding single-parent and multi-parent creation as fundamentally different operations in a monotonic context. The paper also demonstrates that in nonmonotonic models, multi-parent creation can be reduced to single-parent creation, thereby neutralizing the difference in expressive power. Show more

Keywords: Access controls, dynamic authorization, model equivalence, multi-parent creation, protection mechanisms, security

DOI: 10.3233/JCS-1996-42-303

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 149-165, 1996

Authors: Volpano, Dennis | Irvine, Cynthia | Smith, Geoffrey

Article Type: Research Article

Abstract: Ensuring secure information flow within programs in the context of multiple sensitivity levels has been widely studied. Especially noteworthy is Denning's work in secure flow analysis and the lattice model [6,7]. Until now, however, the soundness of Denning's analysis has not been established satisfactorily. We formulate Denning's approach as a type system and present a notion of soundness for the system that can be viewed as a form of noninterference. Soundness is established by proving, with respect to a standard programming language semantics, that all well-typed programs have this noninterference property.

Keywords: Type systems, program security, soundness proofs

DOI: 10.3233/JCS-1996-42-304

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 167-187, 1996

Authors: McDermott, John | Mukkamala, Ravi

Article Type: Research Article

Abstract: A replicated-architecture database system uses data replication to provide multilevel security. The most critical problem associated with replicated architecture multilevel-secure database systems is mutual consistency of the replicas and the impact of mutual consistency requirements on transaction management. Researches have discovered several algorithms for transaction management in replicated architectures. As part of the NRL SINTRA project, we investigate the performance of four of the most promising ones via analytic modeling. We find that all four algorithms have acceptable performance and, over a range of circumstances, can be chosen based on structural considerations rather than on performance.

DOI: 10.3233/JCS-1996-42-305

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 189-228, 1996

Authors: Millen, Jonathan

Article Type: Editorial

DOI: 10.3233/JCS-1996-42-306

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 229-231, 1996

Authors: LaPadula, Leonard J.

Article Type: Editorial

DOI: 10.3233/JCS-1996-42-307

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 233-238, 1996

Authors: LaPadula, Leonard J. | Bell, D. Elliott

Article Type: Research Article

Abstract: This paper presents a set of rules of operation which guarantee that a computer system can remain secure while exhibiting certain desired external characteristics. The rules are easily transformable into algorithms suitable for implementation on a digital computer.

DOI: 10.3233/JCS-1996-42-308

Citation: Journal of Computer Security, vol. 4, no. 2-3, pp. 239-263, 1996