Protocol Insecurity with Finite Number of Sessions is NP-Complete.
Michaël RusinowitchMathieu TuruaniPublished in: CSFW (2001)
Keyphrases
- finite number
- np complete
- np hard
- satisfiability problem
- randomly generated
- convex sets
- lightweight
- fixed number
- extreme points
- np complete problems
- authentication protocol
- communication protocol
- cryptographic protocols
- arbitrarily close
- phase transition
- computational complexity
- pspace complete
- conjunctive queries
- formal analysis
- polynomial time complexity
- data complexity
- average cost
- bounded treewidth
- lower bound