3 May 2018 Security tag computation and propagation in OSFA
Author Affiliations +
Abstract
We will review Saltzer and Schroeder’s security principles of (1) complete mediation; (2) least privilege; and (3) privilege separation. We will also briefly review security tag (or label) propagation. In security tag propagation, a set of rules are used to compute the security attributes of each computation. For example, C = A + B, where A is trusted and B is not trusted. The result C is labeled not trusted. We do not want to use the untrusted result, C, to control any shared computer resource. Using an untrusted result to control (or manage) a shared resource would leave a cybersecurity vulnerability. We illustrate how security tag (or label) propagation can be implemented in the two level security tag architecture in the OS Friendly Microprocessor Architecture. We describe the benefits of using two level security tags for security tag computations.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Patrick Jungwirth, Patrick Jungwirth, Phil Chan, Phil Chan, Eric Imsand, Eric Imsand, Hameed Badawy, Hameed Badawy, } "Security tag computation and propagation in OSFA", Proc. SPIE 10630, Cyber Sensing 2018, 1063004 (3 May 2018); doi: 10.1117/12.2302991; https://doi.org/10.1117/12.2302991
PROCEEDINGS
15 PAGES


SHARE
RELATED CONTENT

Secure it now or secure it later the benefits...
Proceedings of SPIE (May 27 2013)
Security in MANETs using reputation-adjusted routing
Proceedings of SPIE (April 13 2009)
A case of reliable remote functionality
Proceedings of SPIE (July 14 2008)
Bot armies as threats to network security
Proceedings of SPIE (April 08 2007)
Internet firewalls: questions and answers
Proceedings of SPIE (March 11 1996)

Back to Top