WRePP: Workshop on Reduction Proofs in Pseudocode

The study of cryptographic proofs has been an active field of research for over 20 years, since cryptographic constructions and security proofs are notoriously complex. Currently, there are two prominent lines of research that seek to support cryptographic reasoning:

In this workshop, we hope to break down some of the access barriers of the field for those interested in proofs for complex protocols and hope to provide inspiration also to experienced protocol designers and analysts.
The workshop has three goals:
[1] Victor Shoup: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive 2004: 332 (2004)
[2] Mihir Bellare, Phillip Rogaway: The Security of Triple Encryption and a Framework fo Code-Based Game-Playing Proofs. EUROCRYPT 2006
[3] Ran Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOCS 2001
[4] Ueli Maurer, Renato Renner: Abstract Cryptography. ICS 2011
[5] Chris Brzuska, Antoine Delignat-Lavaud, Cedric Fournet, Konrad Kohbrok, Markulf Kohlweiss: State Separation for Code-Based Game-Playing Proofs. ASIACRYPT 2018

Program (tentative)

Organizers: Chris Brzuska and Sabine Oechsner.

Last update: 2020-03-22