Symbolic trace analysis of cryptographic protocols
From MaRDI portal
Recommendations
Cited in
(33)- Gaining trust by tracing security protocols
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
- Symbolic analysis of identity-based protocols
- Models and emerging trends of concurrent constraint programming
- A semantic framework for open processes
- A formal semantics for protocol narrations
- Transducer-based analysis of cryptographic protocols
- Hierarchical combination of intruder theories
- A static analysis of cryptographic processes: the denotational approach
- Cryptographic protocol security analysis based on bounded constructing algorithm
- A symbolic decision procedure for cryptographic protocols with time stamps
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- On the symbolic reduction of processes with cryptographic functions
- A trace logic for local security properties
- Formalising Observer Theory for Environment-Sensitive Bisimulation
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
- Cryptographic Protocols Analysis in Event B
- On-the-Fly Model Checking of Fair Non-repudiation Protocols
- Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
- Comparing State Spaces in Automatic Security Protocol Analysis
- scientific article; zbMATH DE number 1927581 (Why is no real title available?)
- On the reachability problem in cryptographic protocols
- On-the-fly Trace Generation Approach to the Security Analysis of Cryptographic Protocols: Coloured Petri Nets-based Method
- Mathematical Foundations of Computer Science 2003
- An NP decision procedure for protocol insecurity with XOR
- Simulation relations for alternating Büchi automata
- A method for symbolic analysis of security protocols
- Automating security analysis: symbolic equivalence of constraint systems
- Searching for Shapes in Cryptographic Protocols
- Foundations of Software Science and Computation Structures
- A Proof Theoretic Analysis of Intruder Theories
- Decidability issues for extended ping-pong protocols
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis
This page was built for publication: Symbolic trace analysis of cryptographic protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535055)