Probabilistic annotations for protocol models
Cryptography and Security
2023-11-03 v1 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.2108.03901,
title = {Probabilistic annotations for protocol models},
author = {Dusko Pavlovic},
journal= {arXiv preprint arXiv:2108.03901},
year = {2023}
}
Comments
17 pages