协议模型的概率注释
Probabilistic annotations for protocol models
AI总结:
本文提出用带局部性的概率霍尔逻辑进行安全性推理,并以Vernam、El-Gamal密码系统及含信任与噪声的Muddy Children谜题为例验证其有效性。
摘要:
我们描述了如何利用一种带局部性的概率霍尔逻辑进行安全性推理。作为概念验证,我们分析了Vernam和El-Gamal密码系统,证明了它们确实满足的安全性质,并反驳了它们不满足的性质。我们还考虑了Muddy Children谜题的一个版本,其中考虑了儿童的信任和噪声。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。