-
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded... -
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended... -
Protocol Insecurity with Finite Number of Sessions is NP-complete
We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is... -
Implementation and Implications of a Stealth Hard-Drive Backdoor
International audience
