Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete.
Pedro AdãoPaulo MateusLuca ViganòPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- finite number
- cost sensitive
- np complete
- multi class
- misclassification costs
- cost sensitive learning
- cost sensitive classification
- np hard
- binary classification
- convex sets
- computational complexity
- class distribution
- naive bayes
- fraud detection
- class imbalance
- active learning
- confidence weighted
- support vector machine
- special case
- knowledge discovery
- feature vectors
- data sets