Modal logics for cryptographic processes
From MaRDI portal
Recommendations
- Logics for reasoning about cryptographic constructions
- A modal logic for message passing processes
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
- Mathematical Foundations of Computer Science 2003
- Logic for verifying public-key cryptographic protocols
- Verified Decision Procedures for Modal Logics.
- Modal Logic and Equality for Process Algebra
- Modal access control logic. Axiomatization, semantics and FOL theorem proving
- scientific article; zbMATH DE number 3982508
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1251177 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- A calculus for cryptographic protocols: The spi calculus
- A logic of authentication
- Modal logics and mu-calculi: An introduction
- Modal logics for mobile processes
- On the security of public key protocols
- Proof techniques for cryptographic processes
- Results on the propositional \(\mu\)-calculus
- Testing equivalences for processes
Cited in
(9)- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
- Modal logics for mobile processes revisited
- On bisimulations for the spi calculus
- Generalized modal satisfiability
- Secrecy Logic: Protoalgebraic S-Secrecy Logics
- A logical characterisation of static equivalence
- Modal logics for nominal transition systems
- Automating security analysis: symbolic equivalence of constraint systems
- Flow logic for Dolev–Yao secrecy in cryptographic processes
This page was built for publication: Modal logics for cryptographic processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842609)
