Performance Evaluation of Security Protocols Specified in LySa

TL;DR: A special operational semantics is used which helps in predicting quantitative measures on systems describing cryptographic protocols, and map transition systems to Markov chains and evaluate performance of systems, using standard tools.

TL;DR: The overhead introduced by secure functions in considering a case study in non-repudiation is explored and a model of an optimistic fair exchange protocol specified using the Markovian process algebra PEPA is presented.

TL;DR: In this paper , an extensive formal verification of the EAP-AKA protocol is conducted to determine whether the protocol is verifiably secure for 5G networks using ProVerif, a security protocol proof verifier.

TL;DR: This dissertation contributes to the study of security protocol analysis by advancing the emerging field of implementation analysis by presenting two tools which together translate between Java and the LySa process calculus.

TL;DR: Probability and Statistics with Reliability, Queuing and Computer Science Applications, Second Edition as discussed by the authors is a comprehensive introduction to probabiliby, stochastic processes, and statistics for students of computer science, electrical and computer engineering, and applied mathematics.

TL;DR: This volume is the authoritative guide to the Rijndael algorithm and AES and professionals, researchers, and students active or interested in data encryption will find it a valuable source of information and reference.

TL;DR: This document discusses Markov Chains, Direct Methods, Iterative Methods, and Projection Methods for Stochastic Automata Networks, as well as some of the techniques used to design and implement these systems.