Probabilistic annotations for protocol models. Dedicated to Joshua Guttman

DOI10.1007/978-3-030-91631-2_18zbMATH Open1498.68056arXiv2108.03901OpenAlexW4287027068MaRDI QIDQ2154019FDOQ2154019

Dusko Pavlovic

Publication date: 13 July 2022

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.

Full work available at URL: https://arxiv.org/abs/2108.03901

Mathematics Subject Classification ID

Cryptography (94A60) Logic in computer science (03B70) Computer security (68M25)

Cites Work

• EasyCrypt: A Tutorial
• How probabilities came to be objective and subjective
• On the security of public key protocols
• State and progress in strand spaces: proving fair exchange

This page was built for publication: Probabilistic annotations for protocol models. Dedicated to Joshua Guttman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154019)