Models for an adversary-centric protocol logic

DOI10.1016/S1571-0661(04)00245-2MaRDI QIDQ2841218zbMATH OpenFDO

Authors Peter Selinger

Publication date 24 July 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)00245-2

Mathematics Subject Classification ID

Logic in computer science (03B70) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1405638
• Modeling adversaries in a logic for security protocol analysis
• Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
• scientific article; zbMATH DE number 3965967
• Theory of Cryptography

Cites work

• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 1405638 (Why is no real title available?)
• On the security of public key protocols

Cited in

(4)

• Proving semantic properties as first-order satisfiability
• Finite reasons for safety. Parameterized verification by finite model finding
• Modeling adversaries in a logic for security protocol analysis
• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography

This page was built for publication: Models for an adversary-centric protocol logic

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