The following pages link to (Q4536615):
Displaying 24 items.
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Simulation relations for alternating Büchi automata (Q557801) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Analysis of security protocols as open systems (Q1853583) (← links)
- On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404) (← links)
- Bounded memory protocols (Q2339157) (← links)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
- A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
- A symbolic decision procedure for cryptographic protocols with time stamps (Q2568115) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- (Q2842870) (← links)
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols (Q3184787) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
