Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
From MaRDI portal
Publication:3184784
DOI10.1007/978-3-642-03829-7_1zbMath1252.94061MaRDI QIDQ3184784
José Meseguer, Santiago Escobar, Catherine A. Meadows
Publication date: 22 October 2009
Published in: Foundations of Security Analysis and Design V (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03829-7_1
94A60: Cryptography
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An attack on a recursive authentication protocol. A cautionary tale
- Deciding knowledge in security protocols under equational theories
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- On the freedom of decryption
- Conditional rewriting logic as a unified model of concurrency
- Unification modulo ACUI plus distributivity axioms
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Hierarchical combination of intruder theories
- The NRL Protocol Analyzer: An Overview
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Effectively Checking the Finite Variant Property
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- YAPA: A Generic Tool for Computing Intruder Knowledge
- On the security of public key protocols
- Variant Narrowing and Equational Unification
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- Information and Communications Security
- Term Rewriting and Applications
- Computer Aided Verification
