Pages that link to "Item:Q1853612"
From MaRDI portal
The following pages link to On the symbolic reduction of processes with cryptographic functions. (Q1853612):
Displaying 16 items.
- Deciding equivalence-based properties using constraint solving (Q391121) (← links)
- Modeling and verifying ad hoc routing protocols (Q462483) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Bounded memory protocols (Q2339157) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
- Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus (Q2864372) (← links)
- Verifying Cryptographic Protocols with Subterms Constraints (Q3498465) (← links)
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols (Q5458828) (← links)
- Symbolic Bisimulation for the Applied Pi Calculus (Q5458829) (← links)
