A comment on the `basic security theorem' of Bell and LaPadula
Information Processing Letters
Communicating sequential processes
Communicating sequential processes
A timed model for communicating sequential processes
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Algebraic theory of processes
A calculus of mobile processes, II
Information and Computation
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Algebraic proofs of consistency and completeness
Theoretical Computer Science
Proceedings of the 4th ACM conference on Computer and communications security
IEEE Transactions on Software Engineering
Computer security
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Probabilistic noninterference in a concurrent language
Journal of Computer Security
Protection in operating systems
Communications of the ACM
A compiler for analyzing cryptographic protocols using noninterference
ACM Transactions on Software Engineering and Methodology (TOSEM)
Process algebra and non-interference
Journal of Computer Security
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Formal Methods in Systems Engineering: Proceedings of the 2nd Formal Methods Workshop, Held in Drymen, Scotland, 24 - 27 September, 1991
Lattice-Based Access Control Models
Computer
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Unwinding Possibilistic Security Properties
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
A Unifying Approach to Data-Independence
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Probabilistic Polynomial-Time Equivalence and Security Analysis
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Model Checking Guided Abstraction and Analysis
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
ACM SIGOPS Operating Systems Review
What is Intransitive Noninterference?
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Probabilistic Noninterference for Multi-Threaded Programs
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Information transmission in computational systems
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Noninterference Equations for Nondeterministic Systems
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Absorbing covers and intransitive non-interference
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Low-exponent RSA with related messages
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Computers and the sociology of mathematical proof
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Reasoning about XACML policies using CSP
Proceedings of the 2005 workshop on Secure web services
Information flow in secure contexts
Journal of Computer Security
Integration of a security type system into a program logic
Theoretical Computer Science
Petri Net Security Checker: Structural Non-interference at Work
Formal Aspects in Security and Trust
Disentangling the relations between safety and security
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Declassification: Dimensions and principles
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Modelling Opacity Using Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural non-interference in elementary and trace nets
Mathematical Structures in Computer Science
A comparison of semantic models for noninterference
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Closing internal timing channels by transformation
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Security of multithreaded programs by compilation
ACM Transactions on Information and System Security (TISSEC)
Requirements and protocols for inference-proof interactions in information systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A comparison of semantic models for noninterference
Theoretical Computer Science
Unifying theories of confidentiality
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Specifying confidentiality in circus
FM'11 Proceedings of the 17th international conference on Formal methods
On intransitive non-interference in some models of concurrency
Foundations of security analysis and design VI
From security protocols to systems security
Proceedings of the 11th international conference on Security Protocols
Adjoining declassification and attack models by abstract interpretation
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Secure requirements elicitation through triggered message sequence charts
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Bridging language-based and process calculi security
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Security-typed languages for implementation of cryptographic protocols: a case study
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Limiting information leakage in event-based communication
Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security
Opacity generalised to transition systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
What, indeed, is intransitive noninterference?
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Hi-index | 0.00 |
In this chapter I present a process algebraic approach to the modelling of security properties and policies. I will concentrate on the concept of secrecy, also known as confidentiality, and in particular on the notion of non-interference. Non-interference seeks to characterise the absence of information flows through a system and, as such, is a fundamental concept in information security.A central thesis of these lectures is that, viewed from a process algebraic point of view, the problem of characterising non-interference is essentially equivalent to that of characterising the equivalence of processes. The latter is itself a fundamental and delicate question at the heart of process algebra and indeed theoretical computer science: the semantics of a process is intimately linked to the question of which processes should be regarded as equivalent.We start, by way of motivation and to set the context, with a brief historical background. A much fuller exposition of security policies in the wider sense, embracing properties other than secrecy, can be found in the chapter by Pierangela Samarati in this volume. We then cover some elements of process algebra, in particular CSP (Communicating Sequential Processes), that we need and present a formulation of noninterference, along with some more operational presentations of process algebra, including the idea of bi-simulation. I argue that the classical notion of unwinding found in the security literature is really just bisimulation in another guise.Finally, I propose some generalisations of the process algebraic formulations designed to encompass a richer class of policies and examples.