Some laws of non-interference (CSP algebra)

Graham-Cumming, John

doi:10.1109/csfw.1992.236790

Search citation statements

Order By: Relevance

Paper Sections

Select...

Formal Approaches To Confidentiality and Refinement1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Non-interference [4] is a security property, which has been studied extensively and has been formally treated using CSP [6], see for example the work of Allen [1], Graham and Cumming [5], and Roscoe, Woodcock and Wulf [13]. Given a system S and two users u and v, non-interference states that v's view of S is completely unaffected by u's actions.…”

Section: Formal Approaches To Confidentiality and Refinementmentioning

confidence: 99%

Confidentiality-preserving refinement

Heisel

Pfitzmann

Santen

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001.

View full text Add to dashboard Cite

We develop a condition for confidentiality-preserving refinement which is both necessary and sufficient. Using a slight extension of CSP as notation, we give a toy example to illustrate the usefulness of our condition. Systems are specified by their behavior and a window. For an abstract system, the window specifies what information is allowed to be observed by its environment. For a concrete system, the window specifies what information cannot be hidden from its environment. A concrete system is a confidentiality-preserving refinement of an abstract system, if it behaviorally refines the abstract system and if the information revealed by the concrete window is allowed to be revealed according to the abstract window.

show abstract