What semantic equivalences are suitable for non-interference properties in computer security

Authors:
Xiaowei Huang;Li Jiao;Weiming Lu
Affiliations:
Academy of Mathematics and System Science, Chinese Academy of Sciences, P.R. China;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.R. China;Academy of Mathematics and System Science, Chinese Academy of Sciences, P.R. China
Venue:
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Year:
2007

Citing 19
Cited 0

Communicating sequential processes

Communicating sequential processes
Process algebra

Process algebra
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Bisimulation can't be traced

Journal of the ACM (JACM)
Structural operational semantics for weak bisimulations

Theoretical Computer Science
Finite axiom systems for testing preorder and De Simone process languages

Theoretical Computer Science
Impossible futures and determinism

Information Processing Letters
Communication and Concurrency

Communication and Concurrency
Handbook of Process Algebra

Handbook of Process Algebra
Mathematical Models of Computer Security

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Classification of Security Properties (Part I: Information Flow)

FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Information Flow Security in Dynamic Contexts

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Fair testing

Information and Computation
SOS formats and meta-theory: 20 years after

Theoretical Computer Science
Unwinding in Information Flow Security

Electronic Notes in Theoretical Computer Science (ENTCS)
On cool congruence formats for weak bisimulations

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Liveness, fairness and impossible futures

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Non-interference properties are an important class of security properties. Many different non-interference properties have been presented based on different underlying models including the process algebraic languages. Usually, in specifying the non-interference properties using process algebraic languages, a specific semantic equivalence is introduced. Though weak bisimulation based non-interference properties have been studied extensively, it is not always satisfactory. This paper considers the topic on pursuing a probably more suitable semantic equivalence for specifying the non-interference properties. We find several alternatives, e.g., should testing equivalence, impossible future equivalence and possible future equivalence, etc. As another topic in the paper, based on the structural operational semantics, we suggest a compositional rule format, the SISNNI format, for an impossible future equivalence based non-interference property, i.e., the SISNNI property. We show that the SISNNI property is compositional in any SISNNI languages, i.e., languages in the SISNNI format.