Laura Kovács gave the second talk in the seminar series "Women in Logic Online."
Abstract: We advocate a game-theoretic approach for the security analysis of blockchain protocols.
Doing so, we model protocols as games to precisely capture security properties and apply automated reasoning techniques to determine whether a game-theoretic protocol model is game-theoretically secure. Security analysis becomes a satisfiability checking problem in first-order real arithmetic, which we solve within our CheckMate verifier. Our method has been successfully applied to decentralized protocols, board games, and game-theoretic examples.