Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete |
scientific article |
Statements
Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (English)
0 references
6 June 2014
0 references
security
0 references
protocols
0 references
guessing
0 references
verification
0 references
complexity
0 references
0 references
0 references
