# Probabilistic annotations for protocol models

arXiv: https://arxiv.org/abs/2108.03901 · HTML: https://mlsanity.com/paper/2108.03901/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Aug 2021.

## Built on by (most cited first, 1 of 1)

- [Common Knowledge of Abstract Groups](https://mlsanity.com/paper/2211.16284/) (2022)

## Abstract (arXiv)

We describe how a probabilistic Hoare logic with localities can be used for reasoning about security. As a proof-of-concept, we analyze Vernam and El-Gamal cryptosystems, prove the security properties that they do satisfy and disprove those that they do not. We also consider a version of the Muddy Children puzzle, where children's trust and noise are taken into account.