Noninterference for concurrent programs and thread systems
Theoretical Computer Science
A notion of non-interference for timed automata
Fundamenta Informaticae
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
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A decidable notion of timed non-interference
Fundamenta Informaticae - Concurrency specification and programming
The framework of selective interleaving functions and the modular assembly kit
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Information flow in secure contexts
Journal of Computer Security
P-congruences as non-interference for the pi-calculus
Proceedings of the fourth ACM workshop on Formal methods in security
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Information flow security in dynamic contexts
Journal of Computer Security
Controlling information release in the π-calculus
Information and Computation
Compositional information flow security for concurrent programs
Journal of Computer Security
Quantifying Timing Leaks and Cost Optimisation
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Unwinding in Information Flow Security
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Approach to Noninterference for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A comparison of semantic models for noninterference
Theoretical Computer Science
Component-oriented verification of noninterference
Journal of Systems Architecture: the EUROMICRO Journal
Possibilistic information flow control in MAKS and action refinement
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
Analysing the information flow properties of object-capability patterns
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Unwinding conditions for security in imperative languages
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Shedding light on haunted corners of information security
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Model checking adaptive multilevel service compositions
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Towards incrementalization of holistic hyperproperties
POST'12 Proceedings of the First international conference on Principles of Security and Trust
A Decidable Notion of Timed Non-Interference
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
A Notion of Non-Interference for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Automatic covert channel detection in asbestos system (poster abstract)
RAID'12 Proceedings of the 15th international conference on Research in Attacks, Intrusions, and Defenses
Coinductive unwinding of security-relevant hyperproperties
NordSec'12 Proceedings of the 17th Nordic conference on Secure IT Systems
Security completeness: towards noninterference in composed languages
Proceedings of the Eighth ACM SIGPLAN workshop on Programming languages and analysis for security
| Hi-index | 0.00 |
Various formulations of non-interference have been proposed to tryto characterise the absence of information flows in system ornetwork. There is still no consensus in the information securitycommunity as to which of these accurately captures our intuition ofthe notion of secrecy. We argue that non-interference is closely related to thecharacterisation of process equivalence. What constitutes processequivalence is itself a fundamental question in computer sciencewith several distinct definitions proposed in the literature. Weillustrate how several of the definitions of non-interferencemirror notions of process equivalence. Casting these securityconcepts in a process algebraic framework clarifies, for example,the role of non-determinism and allows results to be carried overregarding composition and the completeness of unwinding rules. Wealso discuss some natural generalisations of the approach.