Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
From MaRDI portal
(Redirected from Publication:3631369)
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
- Automata, Languages and Programming
- Automata, Languages and Programming
- Completeness and counter-example generations of a basic protocol logic (extended abstract)
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- On the security of public key protocols
- Probabilistic encryption
- Protocol composition logic (PCL)
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Theory of Cryptography
- Using encryption for authentication in large networks of computers
Cited in
(7)- LACPV'2001. Logical aspects of cryptographic protocol verification. Proceedings of the 1st workshop (a satellite workshop of CAV'01), Paris, France, July 23, 2001.
- Logics for reasoning about cryptographic constructions
- Models for an adversary-centric protocol logic
- Modal logics for cryptographic processes
- scientific article; zbMATH DE number 2043527 (Why is no real title available?)
- Automata, Languages and Programming
- Theory of Cryptography
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)
