Part 1: Game theoretic analysis of cryptographic protocols Speaker 1: Lennart Berg Abstract 1: Some cryptographic protocols can be seen as strategies, and self enforcing protocols can be formally defined in terms of a Nash equilibrium. This will help us to create protocols that works also with strictly self-interested participants.

Part 2: Cryptography to the rescue of game theory

Speaker 2: Jerome Grand'Maison

Abstract 2: The use of a trusted mediator often increase the expected payoffs of players, but is not practical. We will use cryptography and so called "cheap talks" to remove this mediator without changing the outcome of the game.