Home > Research > Publications & Outputs > Multi-rate Threshold FlipThem

Electronic data

  • 611

    Accepted author manuscript, 572 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Multi-rate Threshold FlipThem

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date12/08/2017
Host publicationComputer Security – ESORICS 2017: Lecture Notes in Computer Science, vol 10493
EditorsS. Foley, D. Gollmann, E. Snekkenes
PublisherSpringer
Pages174-190
Number of pages17
ISBN (Electronic)9783319663999
ISBN (Print)9783319663982
<mark>Original language</mark>English

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10493

Abstract

A standard method to protect data and secrets is to apply threshold cryptography in the form of secret sharing. This is motivated by the acceptance that adversaries will compromise systems at some point; and hence using threshold cryptography provides a defence in depth. The existence of such powerful adversaries has also motivated the introduction of game theoretic techniques into the analysis of systems, e.g. via the FlipIt game of van Dijk et al. This work further analyses the case of FlipIt when used with multiple resources, dubbed FlipThem in prior papers. We examine two key extensions of the FlipThem game to more realistic scenarios; namely separate costs and strategies on each resource, and a learning approach obtained using so-called fictitious play in which players do not know about opponent costs, or assume rationality.