Cryptographic Protocol (CP) analysis is a topic of intense research. Meadows describes four approaches for CP verification under investigation in [MEA92] and several authors have categorized protocols based on types of errors they are subject to [BIRD92], [SYV93a],[SYV93b]. This paper addresses the weakness injected into protocols when information is passed in the clear or encrypted only under ...

Acknowledgements I would like to thank some people who were involved in the creation of this thesis: • Berry Schoenmakers of TU Eindhoven for introducing me to the topic of cryptographic voting protocols. • Evangelos Karatsiolis for his work in guiding me through the process of writing this thesis and his constant motivation. • Roberto Samarone Araujo for hours of discussing various protocols w...

An important benchmark for multi-party computation protocols (MPC) is their round complexity. For several MPC tasks, such as broadcast, (tight) lower bounds on the complexity are known. However, some of these can be circumvented when termination every party not a priori known, and simultaneous guaranteed. Protocols with this property called probabilistic-termination (PT) protocols. Running PT i...

Tamarin is a mature, state-of-the-art tool for cryptographic protocol verification. We survey some of the larger tour de force results achieved and show how can formalize protocols, adversary models, properties, scale to substantial, real world, verification problems.