<div class="csl-bib-body">
<div class="csl-entry">Brugger, L. S., Kovács, L., Petkovic Komel, A., Rain, S., & Rawson, M. (2023). CheckMate: Automated Game-Theoretic Security Reasoning. In <i>CCS ’23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 1407–1421). Association for Computing Machinery. https://doi.org/10.1145/3576915.3623183</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/193102
-
dc.description.abstract
We present the CheckMate framework for full automation of game-theoretic security analysis, with particular focus on blockchain technologies. CheckMate analyzes protocols modeled as games for their game-theoretic security - that is, for incentive compatibility and Byzantine fault-tolerance. The framework either proves the protocols secure by providing defense strategies or yields all possible attack vectors. For protocols that are not secure, CheckMate can also provide weakest preconditions under which the protocol becomes secure, if they exist. CheckMate implements a sound and complete encoding of game-theoretic security in first-order linear real arithmetic, thereby reducing security analysis to satisfiability solving. CheckMate further automates efficient handling of case splitting on arithmetic terms. Experiments show CheckMate scales, analyzing games with trillions of strategies that model phases of Bitcoin's Lightning Network.
