Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
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 simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
A static analysis for quantifying information flow in a simple imperative language
Journal of Computer Security
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Information-flow attacks based on limited observations
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Opacity generalised to transition systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Real-time information flow analysis
IEEE Journal on Selected Areas in Communications
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Gained and Excluded Private Actions by Process Observations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Informational Analysis of Security and Integrity
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Quantification of Positive and Negative Attacker's Information
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Fundamenta Informaticae - Concurrency, Specification and Programming
Hi-index | 0.00 |
A quantification of process's security by quantification of an amount of information flow is defined and studied in the framework of timed process algebras. The resulting quantified security is compared with other (qualitative) security notions. Unprecise and limited observations are defined and discussed.