A noninterference model and hidden channels
Diskretnaya Matematika, Tome 14 (2002) no. 1, pp. 11-16
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider mathematical models of secure systems, namely, the traditional non-interference model and a probabilistic non-interference model. We demonstrate that a system can satisfy the conditions of the traditional non-interference model in presence of a subliminal channel from the high-security domain to the low-security one. We give a sufficient condition for absence of a system of subliminal channels in the automaton model.This research was supported by the Russian Foundation for Basic Research, grant 01–01–00895.
[1] Moskowitz I. S., Costich O. L., “A classical automata approach to noninterference type problems”, Proc. Computer Security Foundations Workshop V, IEEE Press, 1992, 2–8