Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
From MaRDI portal
Publication:3631369
DOI10.1007/978-3-642-02002-5_3zbMath1242.94017OpenAlexW1580671553MaRDI QIDQ3631369
Koji Hasebe, Gergei Bana, Mitsuhiro Okada
Publication date: 9 June 2009
Published in: Formal to Practical Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02002-5_3
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Protocol Composition Logic (PCL)
- On the security of public key protocols
- Using encryption for authentication in large networks of computers
- Automata, Languages and Programming
- Automata, Languages and Programming
- Theory of Cryptography
- Foundations of Software Science and Computation Structures
This page was built for publication: Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols