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.

翻译：我们描述了如何利用Hoare与地方的概率逻辑来推理安全。 作为概念的证明,我们分析了Vernam和El-Gamal加密系统,证明了它们确实满足的安全特性,并反驳了它们没有满足的安全特性。 我们还考虑了穆迪儿童拼图的版本,其中考虑到了儿童的信任和噪音。