ACM Transactions on Programming Languages and Systems (TOPLAS)
A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A Model of Noninterference for Integrating Mixed Criticality Software Components
DCCA '99 Proceedings of the conference on Dependable Computing for Critical Applications
Comparing Two Information Flow Security Properties
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
What is Intransitive Noninterference?
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Channels with side information at the transmitter
IBM Journal of Research and Development
Towards Development of Secure Systems Using UMLsec
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Transforming Processes to Check and Ensure Information Flow Security
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Confidentiality-Preserving Refinement is Compositional - Sometimes
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Non-Interference for Deterministic Interactive Programs
Formal Aspects in Security and Trust
Component-oriented verification of noninterference
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Information flow security is that aspect of computer security concerned with how confidential information is allowed to flow through a computer system. This is especially subtle when considering processes that are executed concurrently. We consider the notion of Probabilistic Noninterference (PNI) proposed in the literature to ensure secure information flow in concurrent processes. In the setting of a model of probabilistic dataflow, we provide a number of important results towards simplified verification that suggest relevance in the interaction of probabilistic processes outside this particular framework: PNI is shown to be compositional by casting it into a rely-guarantee framework, where the proof yields a more general Inductive Compositionality Principle. We deliver a considerably simplified criterion equivalent to PNI by "factoring out" the probabilistic behaviour of the environment. We show that the simpler nonprobabilistic notion of Nondeducibility-on-Strategies proposed in the literature is an instantiation of PNI, allowing us to extend our results to it.