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 NP-complete in a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports nonatomic symmetric encryption keys. We also prove that in order to build an attack with a fixed number of sessions the intruder needs only to forge messages of polynomial size, provided that they are represented as dags.
|
703
|
On the security of public key protocols
– Dolev, Yao
- 1983
|
|
329
|
The inductive approach to verifying cryptographic protocols
– Paulson
- 1998
|
|
211
|
Automated Analysis of Cryptographic Protocols Using Murphi
– Mitchell, Mitchell, et al.
- 1997
|
|
200
|
The NRL protocol analyzer: An overview
– Meadows
- 1996
|
|
176
|
A Survey of Authentication Protocol Literature: Version 1.0
– Clark, Jacob
- 1997
|
|
155
|
A compiler for the analysis of security protocols
– Casper
- 1997
|
|
128
|
A meta-notation for protocol analysis
– Cervesato, Durgin, et al.
- 1999
|
|
79
|
Towards a completeness result for model checking of security protocols
– Lowe
- 1999
|
|
78
|
On the reachability prob-lem in cryptographic protocols
– Amadio, Lugiez
|
|
77
|
Applying Formal Methods to the Analysis of Key Management Protocol
– Meadows
- 1992
|
|
68
|
Verifying Authentication Protocols withCSP
– Schneider
- 1997
|
|
54
|
Using state space exploration and a natural deduction style message derivation engine to verify security protocols
– Clarke, Jha, et al.
- 1998
|
|
45
|
Capsl integrated protocol environment
– Denker, Millen
- 2000
|
|
45
|
On the security of multi-party ping pong protocols
– Even, Goldreich
- 1983
|
|
44
|
CAPSL: Common Authentication Protocol Specification Language
– Millen
- 1997
|
|
41
|
A method for automatic cryptographic protocol verification
– Goubault-Larrecq
|
|
36
|
Protocol spec-ification and analysis in Maude
– Denker, Meseguer, et al.
- 1998
|
|
32
|
Towards the formal verification of elec-tronic commerce protocols
– Bolignano
- 1997
|
|
30
|
Efficient infinite-state analysis of security protocols
– HUIMA
- 1999
|
|
23
|
Towards automatic ver-ification of authentication protocols on an unbounded network
– Heather, Schneider
- 2000
|
|
21
|
A tool for lazy verification of security protocols
– Chevalier, Vigneron
- 2001
|
|
18
|
Lazy infinite-state analysis of security pro-tocols
– Basin
|
|
15
|
Modelling and Verifying Key Exchange Protocols using CSP and FDR
– ROSCOE
- 1995
|
|
14
|
Optimizing protocol rewrite rules of CIL specifications
– Denker, Millen, et al.
- 2000
|
|
8
|
Tree Automata with One Memory
– Comon, Cortier, et al.
- 2001
|
|
8
|
Languages for description and analysis of authentication protocols
– Martinelli
- 1998
|
|
7
|
Towards efficient automated verification of security protocols
– Chevalier, Vigneron
- 2001
|
|
4
|
Undecidability of Bounded Security
– Durgin, Lincoln, et al.
- 1999
|
|
3
|
Analyzing a library of protocols using Casper and FDR
– Donovan, Norris, et al.
|
|
3
|
Compiling and Verifying Security Protocols. Logic for Programming and Automated Reasoning
– Jacquemard, Rusinowitch, et al.
- 2000
|
|
1
|
Bounded-Process Cryptographic Protocol Analysis to appear
– Millen, Shmatikov
- 2001
|
|
1
|
Goubault-Larrecq A Method for Automatic Cryptographic Protocol Verification (Extended Abstract
– Jean
- 2000
|
|
1
|
Efficient infinite-state ananysis of security protocols
– Huima
- 1999
|
