Building Confidence in Cryptographic Protocols

What this post added

This post introduces the concept of formal analysis and security proofs for cryptographic protocols, using KEMTLS as an example. It explains how process algebras and tools like Tamarin are used to model protocols, define security properties, and construct proofs by exploring all possible protocol runs. The post details the structure of Tamarin rules, including preconditions, actions, and postconditions, and how they are used to build a tree representing protocol execution paths.