Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Communication and Concurrency
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Probabilistic Noninterference in a Concurrent Language
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Probabilistic Noninterference for Multi-Threaded Programs
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Journal of Computer Security - Special issue on WITS'02
A Quantitative Approach to Noninterference for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
| Hi-index | 0.00 |
We advocate the use of approximate noninterference for the security analysis of probabilistic protocols. Our approach relies on a formalisation of the protocol in the setting of a probabilistic process algebra and a notion of process similarity based on weak probabilistic bisimulation. We illustrate this approach by presenting the analysis of a probabilistic nonrepudiation protocol which allows us to quantitatively estimate its fairness degree.