A secure state is an information systems security term to describe where entities in a computer system are divided into subjects and objects, and it can be formally proven that each state transition preserves security by moving from one secure state to another secure state. Thereby it can be inductively proven that the system is secure. As defined in the Bell–LaPadula model, the secure state is built on the concept of a state machine with a set of allowable states in a system. The transition from one state to another state is defined by transition functions.
A system state is defined to be "secure" if the only permitted access modes of subjects to objects are in accordance with a security policy.
- Fisch, Eric A.; White, Gregory B. (2000), Secure Computers and Networks: Analysis, Design, and Implementation, Boca Raton: CRC Press, pp. 39–42, ISBN 9780849318689, OCLC 849972357, retrieved 13 March 2018