Modal Logics for Cryptographic Processes
From MaRDI portal
Publication:2842609
DOI10.1016/S1571-0661(05)80368-8zbMath1270.03038MaRDI QIDQ2842609
Jesper Nyholm Jensen, Ulrik Frendrup, Hans Hüttel
Publication date: 15 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
03B45: Modal logic (including the logic of norms)
94A60: Cryptography
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
A Logical Characterisation of Static Equivalence, Unnamed Item, Automating Security Analysis: Symbolic Equivalence of Constraint Systems, Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography, Generalized modal satisfiability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modal logics for mobile processes
- Results on the propositional \(\mu\)-calculus
- A calculus for cryptographic protocols: The spi calculus
- Testing equivalences for processes
- Proof Techniques for Cryptographic Processes
- On the security of public key protocols
- A logic of authentication