Threshold FlipThem:when the winner does not need to take all

Leslie, David and Sherfield, Chris L. and Smart, Nigel P. (2015) Threshold FlipThem:when the winner does not need to take all. In: Decision and Game Theory for Security. Lecture Notes in Computer Science . Springer, Cham, pp. 74-92. ISBN 9783319255934

[img]
Preview
PDF (784)
784.pdf - Accepted Version

Download (336kB)

Abstract

We examine a FlipIt game in which there are multiple resources which a monolithic attacker is trying to compromise. This extension to FlipIt was considered in a paper in GameSec 2014, and was there called FlipThem. Our analysis of such a situation is focused on the situation where the attacker’s goal is to compromise a threshold of the resources. We use our game theoretic model to enable a defender to choose the correct configuration of resources (number of resources and the threshold) so as to ensure that it makes no sense for a rational adversary to try to attack the system. This selection is made on the basis of the relative costs of the attacker and the defender.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
75060
Deposited By:
Deposited On:
07 Aug 2015 12:10
Refereed?:
Yes
Published?:
Published
Last Modified:
06 Jul 2020 23:39