The Ipurge Unwinding Theorem for CSP Noninterference Security

 

Title: The Ipurge Unwinding Theorem for CSP Noninterference Security
Author: Pasquale Noce (pasquale /dot/ noce /dot/ lavoro /at/ gmail /dot/ com)
Submission date: 2015-06-11
Abstract:

The definition of noninterference security for Communicating Sequential Processes requires to consider any possible future, i.e. any indefinitely long sequence of subsequent events and any indefinitely large set of refused events associated to that sequence, for each process trace. In order to render the verification of the security of a process more straightforward, there is a need of some sufficient condition for security such that just individual accepted and refused events, rather than unbounded sequences and sets of events, have to be considered.

Of course, if such a sufficient condition were necessary as well, it would be even more valuable, since it would permit to prove not only that a process is secure by verifying that the condition holds, but also that a process is not secure by verifying that the condition fails to hold.

This paper provides a necessary and sufficient condition for CSP noninterference security, which indeed requires to just consider individual accepted and refused events and applies to the general case of a possibly intransitive policy. This condition follows Rushby's output consistency for deterministic state machines with outputs, and has to be satisfied by a specific function mapping security domains into equivalence relations over process traces. The definition of this function makes use of an intransitive purge function following Rushby's one; hence the name given to the condition, Ipurge Unwinding Theorem.

Furthermore, in accordance with Hoare's formal definition of deterministic processes, it is shown that a process is deterministic just in case it is a trace set process, i.e. it may be identified by means of a trace set alone, matching the set of its traces, in place of a failures-divergences pair. Then, variants of the Ipurge Unwinding Theorem are proven for deterministic processes and trace set processes.

BibTeX:
@article{Noninterference_Ipurge_Unwinding-AFP,
  author  = {Pasquale Noce},
  title   = {The Ipurge Unwinding Theorem for CSP Noninterference Security},
  journal = {Archive of Formal Proofs},
  month   = jun,
  year    = 2015,
  note    = {\url{http://isa-afp.org/entries/Noninterference_Ipurge_Unwinding.shtml},
            Formal proof development},
  ISSN    = {2150-914x},
}
License: BSD License
Depends on: List_Interleaving, Noninterference_CSP
Used by: Noninterference_Generic_Unwinding, Noninterference_Inductive_Unwinding, Noninterference_Sequential_Composition