An effective model for composition of secure systems

Journal of Systems and Software

Volumn 43, Issue 3, 1998, Pages 233-244

  Shi, Q ^a   Zhang, N ^b  

^a LIVERPOOL JOHN MOORES UNIVERSITY   (United Kingdom)

^b MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; DISTRIBUTED COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; SECURITY OF DATA;

SECURE SYSTEM;

SYSTEMS ANALYSIS;

EID: 0032202421     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(98)10036-5     Document Type: Article

References (19)

1. Amoroso, E., Merritt, M., 1994. Composing system integrity using I/O automata. In: Proceedings of The Annual Computer Security Applications Conference, pp. 34-43.
2. Bell, D.E., LaPadula, L.J., 1976. Secure computer system: Unified exposition and multics interpretation, ESD-TR-75-306. Electron. Syst. Division, AFSC, Hanscom AF Base, Bedford, MA.
3. Boulahia-Cuppens, N., Cuppens, F., 1994. Asynchronous composition and required security conditions. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 68-78.
4. Coulouris, G., 1994. Distributed Systems: Concepts and Design. Addison-Wesley, Reading, MA.
5. Dinolt, G.W., Benzinger, L.A., Yatabe, M.G., 1994. Combining components and policies. In: Proceedings of The Computer Security Foundations Workshop, pp. 22-35.
6. Goguen, J.A., Meseguer, J., 1982. Security policies and security models. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 11-20.
7. Johnson, D.M., Thayer, F.J., 1988. Security and the composition of machines. In: Proceedings of The Computer Security Foundations Workshop, pp. 72-89.
8. Kemmerer, R.A., 1983. Shared resource matrix methodology: An approach to identifying storage and timing channels. ACM Transactions on Computer Systems 1 (3), 256-277.
9. Maneki, A.P., 1995. Algebraic properties of system composition in the LORAL, Ulysses and McLean trace models. In: Proceedings of The Computer Security Foundations Workshop, pp. 16-23.
10. McCullough, D., 1990. A hookup theorem for multilevel security. IEEE Transactions on Software Engineering 16 (6), 563-568.
11. McLean, J., 1996. A general theory of composition for a class of "possibility" properties. IEEE Transactions on Software Engineering 22 (1), 53-67.
12. Meadows, C., 1992. Using traces based on procedure calls to reason about composability. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 177-188.
13. Millen, J.K., 1990. Hookup security for synchronous machines. In: Proceedings of The Computer Security Foundations Workshop, pp. 84-89.
14. Roscoe, A.W., Wulf, L., 1995. Composing and decomposing systems under security properties. In: Proceedings of the Computer Security Foundations Workshop, pp. 9-15.
15. Sandhu, R.S., Samarati, P., 1994. Access control: Principles and practice. IEEE Communications Magazine 32 (9), 40-48.
16. Shi, Q., McDermid, J.A., 1993. Applying non-interference to composition of systems: A more practical approach. In: Proceedings of The Ninth Annual Computer Security Applications Conference, pp. 210-220.
17. Sutherland, D., 1986. A model of information. In: Proceedings of the Ninth National Computer Security Conference, pp. 175-183.
18. Wittbold, J.T., Johnson, D.M., 1990. Information flow in nondeterministic systems In: Proceedings of IEEE Symposium on Security and Privacy, pp. 144-161.
19. Zakinthinos, A., Lee, E.S., 1995. The composability of non-interference. In: Proceedings of The Computer Security Foundations Workshop, pp. 2-8.