Rewriting for cryptographic protocol verification
From MaRDI portal
Recommendations
Cited in
(45)- Closure properties and decision problems of dag automata
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
- Match-bounded string rewriting systems
- Alternating two-way AC-tree automata
- Towards more precise rewriting approximations
- Tree automata with equality constraints modulo equational theories
- Tree automata for rewrite strategies
- Transducer-based analysis of cryptographic protocols
- On the relationships between models in protocol verification
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Applications of term rewriting to cryptographic protocol analysis. (Overview of the invited talk)
- Synchronized tree languages for reachability in non-right-linear term rewrite systems
- Information based reasoning about security protocols
- A rewriting strategy for protocol verification
- Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting
- Rewriting-based verification of authentication protocols
- Cryptographic Verification by Typing for a Sample Protocol Implementation
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
- scientific article; zbMATH DE number 5141412 (Why is no real title available?)
- Verifying Cryptographic Protocols with Subterms Constraints
- An improved formal model of cryptographic protocols
- Rigid Tree Automata
- TAGED Approximations for Temporal Properties Model-Checking
- How to Tackle Integer Weighted Automata Positivity
- From secrecy to authenticity in security protocols
- scientific article; zbMATH DE number 1956510 (Why is no real title available?)
- Tree pattern matching from regular tree expressions.
- Reachability in conditional term rewriting systems
- Symbol different term rewrite systems
- Handling left-quadratic rules when completing tree automata
- Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
- On proving soundness of the computationally equivalent transformation for normal conditional term rewriting systems by using unravelings
- Towards an Efficient Implementation of Tree Automata Completion
- Rigid tree automata and applications
- Reachability analysis over term rewriting systems
- SAT-based automated completion for reachability analysis
- CHAP and rewrite components
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- Complete symbolic reachability analysis using back-and-forth narrowing
- Injective synchronisation: An extension of the authentication hierarchy
- 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
- A theoretical limit for safety verification techniques with regular fix-point computations
- Equational approximations for tree automata completion
This page was built for publication: Rewriting for cryptographic protocol verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723425)
