Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:50, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Protocol insecurity with a finite number of sessions and composed keys is NP-complete. |
scientific article |
Statements
Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (English)
0 references
25 May 2003
0 references
Verification
0 references
Security
0 references
Protocols
0 references
Rewriting
0 references
Complexity
0 references
