Formal and Computational Cryptographic Proofs

This is the tentative programme of the above workshop.

If we have an abstract it will appear by hovering over the title.

To register for the workshop/see extra details please visit the main Workshop Page.

Tuesday 10th April Wednesday 11th April Thursday 12th April Friday 13th April
09.00-10.00 Registration P. Rogaway
Garbled Circuits
P. Persiano
Definitions of Predicate Encryption
M. Naor
T.B.A.
10.00-11.00 A. Gordon
Verifying Crypto Protocols Written in C
M. Fischlin
Meta-Reductions
E. Kiltz
How Provably Secure are Cryptographic Primitives used in Practice?
K. Pietrzak
How to Fake Auxiliary Input
11.00-11.30 Morning Coffee
11.30-12.30 V. Vaikuntanathan
Multi-key Homomorphic Encryption and Applications
J. Groth
Pairing-based Succinct Non-interactive Zero-Knowledge Arguments
D. Pointcheval
Efficient Smooth Projective Hash Functions and Applications
B. Barak
Zero Knowledge Proofs and Nuclear Disarmament
12.30-13.30 Lunch @ Wolfson Court
13.30-14.30 B. Warinschi
Compositionality of game-based secure key-exchange
B. Blanchet
From CryptoVerif Specifications to Computationally Secure Implementations of Protocols
A. Sahai
Leakage-Resilient Zero-Knowledge Proofs and their Applications.
C. Fournet
Modular Cryptographic Verification for an Implementation of TLS 1.2
14.30-15.30 S. Micali
Rational Proofs.
C. Gentry
Quadratic Span Programs for Succinct NIZKs without PCPs
Y. Tauman Kalai
Where Delegation Meets Einstein
Y. Dodis
Overcoming Weak Expectations
15.30-16.00 Afternoon Tea
16.00-17.00 U. Maurer
Constructive Cryptography
G. Rothblum
How to Compute in the Presence of Leakage
S. Tessaro
Semantic Security for the Wiretap Channel
G. Barthe
Computer-aided security proofs
17.00-18.00 Drinks Reception Rothschild Lecture
Shafi Goldwasser
Pseudo Deterministic Algorithms and Applications to Cryptography
19.30 Conference Dinner @ Gonville and Caius