Modal Logics for Cryptographic Processes

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)

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Unnamed Item ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ Automating Security Analysis: Symbolic Equivalence of Constraint Systems ⋮ Generalized modal satisfiability ⋮ A Logical Characterisation of Static Equivalence

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

This page was built for publication: Modal Logics for Cryptographic Processes