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

David Leslie, Chris Sherfield, Nigel Smart

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

8 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationDecision and Game Theory for Security - GameSec 2015
PublisherSpringer
Pages74-92
Number of pages19
Volume9406
ISBN (Electronic)978-3-319-25594-1
ISBN (Print)978-3-319-25593-4
DOIs
Publication statusPublished - 4 Nov 2015

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Threshold FlipThem: When the winner does not need to take all'. Together they form a unique fingerprint.

Cite this