Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
A compositional approach to performance modelling
A compositional approach to performance modelling
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
A calculus for cryptographic protocols
Information and Computation
Non-interleaving semantics for mobile processes
Theoretical Computer Science
A cost-based framework for analysis of denial of service in networks
Journal of Computer Security
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Performance Evaluation of Mobile Processes via Abstract Machines
IEEE Transactions on Software Engineering
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
The Design of Rijndael
Language-based performance prediction for distributed and mobile systems
Information and Computation
Towards Performance Evaluation with General Distributions in Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A calculus for control flow analysis of security protocols
International Journal of Information Security - Special issue on security in global computing
Probability, Statistics, and Queueing Theory with Computer Science Applications
Probability, Statistics, and Queueing Theory with Computer Science Applications
Static validation of security protocols
Journal of Computer Security
Performance Evaluation of Security Protocols Specified in LySa
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Study of Two Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We use an enhanced operational semantics to infer quantitative measures on systems describing cryptographic protocols. System transitions carry enhanced labels. We assign rates to transitions by only looking at these labels. The rates reflect the distributed architecture running applications and the use of possibly different crypto-systems. We then map transition systems to Markov chains and evaluate performance of systems, using standard tools.