Paper 2015/784 Original: eprint.iacr.org/2015/784 ↗
Threshold FlipThem: When the winner does not need to take all
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
- Preprint.
- History
- 2015-08-06: last updated
- 2015-08-06: published
- Short URL
- https://ia.cr/2015/784
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}