Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
From MaRDI portal
Publication:3631369
DOI10.1007/978-3-642-02002-5_3zbMATH Open1242.94017OpenAlexW1580671553MaRDI QIDQ3631369FDOQ3631369
Authors: Gergei Bana, Koji Hasebe, 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
Recommendations
- Automata, Languages and Programming
- Theory of Cryptography
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
Cites Work
- Probabilistic encryption
- Title not available (Why is that?)
- Using encryption for authentication in large networks of computers
- On the security of public key protocols
- Automata, Languages and Programming
- Foundations of Software Science and Computation Structures
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Theory of Cryptography
- Protocol composition logic (PCL)
- Automata, Languages and Programming
- Completeness and counter-example generations of a basic protocol logic (extended abstract)
Cited In (7)
- Theory of Cryptography
- Logics for reasoning about cryptographic constructions
- Models for an adversary-centric protocol logic
- Modal logics for cryptographic processes
- LACPV'2001. Logical aspects of cryptographic protocol verification. Proceedings of the 1st workshop (a satellite workshop of CAV'01), Paris, France, July 23, 2001.
- Title not available (Why is that?)
- Automata, Languages and Programming
This page was built for publication: Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631369)
