Version 1
: Received: 25 April 2021 / Approved: 27 April 2021 / Online: 27 April 2021 (12:33:23 CEST)
How to cite:
Jormakka, J.; Ghosh, S. Analysis of Risks and Costs in Intruder Detection With Markov Decision Processes. Preprints2021, 2021040713. https://doi.org/10.20944/preprints202104.0713.v1
Jormakka, J.; Ghosh, S. Analysis of Risks and Costs in Intruder Detection With Markov Decision Processes. Preprints 2021, 2021040713. https://doi.org/10.20944/preprints202104.0713.v1
Jormakka, J.; Ghosh, S. Analysis of Risks and Costs in Intruder Detection With Markov Decision Processes. Preprints2021, 2021040713. https://doi.org/10.20944/preprints202104.0713.v1
APA Style
Jormakka, J., & Ghosh, S. (2021). Analysis of Risks and Costs in Intruder Detection With Markov Decision Processes. Preprints. https://doi.org/10.20944/preprints202104.0713.v1
Chicago/Turabian Style
Jormakka, J. and Sourangshu Ghosh. 2021 "Analysis of Risks and Costs in Intruder Detection With Markov Decision Processes" Preprints. https://doi.org/10.20944/preprints202104.0713.v1
Abstract
Let us assume that defence mechanisms are so strong that the average outcome of a hacking attack is unsuccessful. How to calculate the costs arising from false positives and false negatives in intruder detection? Is it better for the hacker to make fewer but more effective attacks rather than several but less effective attacks? How to calculate the difference between these alternative strategies?
Keywords
combinatorics, risk analysis, decision analysis.
Subject
Computer Science and Mathematics, Algebra and Number Theory
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.