Automating Game Reasoning in Blockchain Security
Talk by Laura Kovacs
Location: TU Wien,
Date/Time: 2024-11-25 17:00 ‒ 18:00
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.
This is a joint work with Ivana Bocevska, Lea Brugger, Anja Petkovic Komel, Sophie Rain and Michael Rawson.
The talk is a part of the seminar series called “Women in Logic Online”.
Bio: Laura Kovács is a full professor of computer science at the TU Wien, leading the automated program reasoning (APRe) group of the Formal Methods in Systems Engineering division. Her research focuses on the design and development of new theories, technologies, and tools for program analysis, with a particular focus on automated assertion generation, symbolic summation, computer algebra, and automated theorem proving. She is the co-developer of the Vampire theorem prover and a Wallenberg Academy Fellow of Sweden. Her research has also been awarded with an ERC Starting Grant 2014, an ERC Proof of Concept Grant 2018, an ERC Consolidator Grant 2020, and two Amazon Research Awards (2020 and 2023). Recently, she received financial support from LEA Frauenfonds to disseminate unplugged computer science to elementary schools, while organizing computer science workshops with school children at the TU Wien.
