A taxonomy of trace-based security properties for CCS
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 126-136
- https://doi.org/10.1109/csfw.1994.315941
Abstract
Several information flow security definitions, proposed in the literature, are generalized and adapted to the model of labelled transition systems. This very general model has been widely used as a semantic domain for process algebras, such as Milner's CCS. As a by-product, we provide CCS with a set of security notions, hence relating these two areas of concurrency research. A classification of these generalised security definitions is presented, taking into account also some additional properties, such as input totality, which can influence this taxonomy. We also show that some of these security properties are composable w.r.t. the operators of parallellism and action restriction.<>Keywords
This publication has 9 references indexed in Scilit:
- Noninterference and the composability of security propertiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Toward a mathematical foundation for information flow securityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hookup security for synchronous machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- A Logical View of Secure Dependencies*Journal of Computer Security, 1992
- A hookup theorem for multilevel securityIEEE Transactions on Software Engineering, 1990
- Information flow in nondeterministic systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Security Policies and Security ModelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Formal verification of parallel programsCommunications of the ACM, 1976