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

David Leslie; Chris Sherfield; Nigel P.  Smart

Paper 2015/784

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

David Leslie, Chris Sherfield, and Nigel P. Smart

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.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. GameSec 2015
Contact author(s): nigel @ cs bris ac uk
History: 2015-08-06: received
Short URL: https://ia.cr/2015/784
License: CC BY

BibTeX

@misc{cryptoeprint:2015/784,
      author = {David Leslie and Chris Sherfield and Nigel P.  Smart},
      title = {Threshold {FlipThem}: When the winner does not need to take all},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/784},
      year = {2015},
      url = {https://eprint.iacr.org/2015/784}
}