On probabilistic timed automata
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
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Verifying Automata Specifications of Probabilistic Real-time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Model checking for probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |
We define a probabilistic model for the analysis of a Non-Repudiation protocol that guarantees fairness, without resorting to a trusted third party, by means of a probabilistic algorithm. By using the PRISM model checker, we estimate the probability for a malicious user to break the non-repudiation property, depending on various parameters of the protocol.