Scaling CheckMate for Game-Theoretic Security

10 pages•Published: May 26, 2024

Sophie Rain, Lea Salome Brugger, Anja Petković Komel, Laura Kovács and Michael Rawson

Abstract

We present the CheckMate tool for automated verification of game-theoretic secu- rity properties, with application to blockchain protocols. CheckMate applies automated reasoning techniques to determine whether a game-theoretic protocol model is game- theoretically secure, that is, Byzantine fault tolerant and incentive compatible. We describe CheckMate’s input format and its various components, modes, and output. CheckMate is evaluated on 15 benchmarks, including models of decentralized protocols, board games, and game-theoretic examples.

Keyphrases: automated reasoning, blockchain protocols, game theoretic security, incentive compatibility, protocol verification

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 100, pages 222-231.

Links:	https://easychair.org/publications/paper/6ZDH
	https://doi.org/10.29007/llnq

BibTeX entry

@inproceedings{LPAR2024:Scaling_CheckMate_Game_Theoretic,
  author    = {Sophie Rain and Lea Salome Brugger and Anja Petković Komel and Laura Kovács and Michael Rawson},
  title     = {Scaling CheckMate for Game-Theoretic Security},
  booktitle = {Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {100},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/6ZDH},
  doi       = {10.29007/llnq},
  pages     = {222-231},
  year      = {2024}}

Download PDF Open PDF in browser