Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
From MaRDI portal
Publication:953531
DOI10.1016/J.JLAP.2008.05.005zbMATH Open1151.94012OpenAlexW2023361932MaRDI QIDQ953531FDOQ953531
Publication date: 6 November 2008
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2008.05.005
Recommendations
Cites Work
- Modal logic
- Title not available (Why is that?)
- Many-dimensional modal logics: theory and applications
- Duration calculus. A formal approach to real-time systems.
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus for cryptographic protocols: The spi calculus
- Explicit provability and constructive semantics
- Handbook of modal logic
- Foundations of Cryptography
- Foundations of Cryptography
- Mobile values, new names, and secure communication
- Handbook of process algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Defeasible deontic logic
- Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis
- Title not available (Why is that?)
- Protocols for authentification and key establishment
- Introducing Justification into Epistemic Logic
- A logic of authentication
- A calculus of durations
- Optimistic fair exchange of digital signatures
- Representing and Reasoning with Operational Semantics
- On the security of public key protocols
- Static Analysis
- Interactive Computation
- Title not available (Why is that?)
- Analyzing security protocols with secrecy types and logic programs
- A new logic for electronic commerce protocols
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Title not available (Why is that?)
- Correct Hardware Design and Verification Methods
- CONCUR 2005 – Concurrency Theory
- Title not available (Why is that?)
- Security protocols and their properties
- Towards an awareness-based semantics for security protocol analysis
- A semantics for a logic of authentication (extended abstract)
- Verifying security protocols as planning in logic programming
- Ordering from Satan's menu: a survey of requirements specification for formal analysis of cryptographic protocols
- A simple framework for real-time cryptographic protocol analysis with compositional proof rules
- Logics for reasoning about cryptographic constructions
- A symbolic decision procedure for cryptographic protocols with time stamps
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Models for an adversary-centric protocol logic
- Modal logics for cryptographic processes
- Logic for verifying public-key cryptographic protocols
- Title not available (Why is that?)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- A quantifier-free first-order knowledge logic of authentication
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953531)