Protocol insecurity with a finite number of sessions, composed keys is NP-complete.
Michaël RusinowitchMathieu TuruaniPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- finite number
- np complete
- np hard
- randomly generated
- satisfiability problem
- arbitrarily close
- computational complexity
- convex sets
- cryptographic protocols
- lightweight
- pspace complete
- fixed number
- key agreement
- average cost
- polynomial time complexity
- conjunctive queries
- quasiconvex
- extreme points
- bounded treewidth
- secret key
- hash functions
- phase transition
- authentication protocol
- security protocols
- security analysis
- provably secure
- special case
- relational databases