Summer School On Provable Security

Barcelona

September 7th - 11th 2009

Programme

Note: 6th Sept : To cope with the later time for lunches in Spain we have adjusted the programme times a little.

Monday Tuesday Wednesday Thursday Friday

09.00-10.15 A. Dent
Introduction to Provable Security E.Kiltz
Public Key Encryption-1 T. Shrimpton
Hash Functions-2 V. Lyubashevsky
Cryptography and Lattices K. Paterson
The Real World-1

10.15-10.45 Break

10.45-12.00 A. Dent
Introduction to Provable Security G. Neven
Digital Signatures-1 X. Boyen
Pairing Based Systems-1 X. Boyen
Pairing Based Systems-2 B. Warinschi
Symbolic Methods-2

12.15-13.30 P. Rogaway
Symmetric Techniques-1 E.Kiltz
Public Key Encryption-2 G. Neven
Digital Signatures-2 B. Blanchet
Automating Security Proofs-1 B. Blanchet
Automating Security Proofs-2

13.30-15.15 Lunch

15.15-16.30 P. Rogaway
Symmetric Techniques-2 T. Shrimpton
Hash Functions-1 V. Lyubashevsky
Cryptography and Lattices B. Warinschi
Symbolic Methods-1 K. Paterson
The Real World-2

16.30-17.30 Problems Session End

Short Communication Sessions

As can be seen from the timetable above we timetabled each day a Problems Session. These were for PhD students and others to present their on going work and to obtain feedback from others participating in the summer school.

The people who spoke in these sessions were:

Kimmo Halunen. Iterated Hash Functions as Finite Automata - Theory and Results
Angel Perez del Pozo. Some remarks on the security of cryptosystem MST_3
Pedro Duarte. Logarithmic Signatures and Commitment Schemes
Long Nguyen. New combinatorial bounds for almost universal hash functions
Andre Souto. Individual Zero Knowledge
Marion Daubignard. Computational Indistinguishable Logic
Sylvain Heraud. Automating Language-Based Cryptographic Proofs
Madeline Gonzalez. Digital Signature Security in the Presence of Key-Dependent Messages
Carla Rafols. Some recent results on bit security
Alvar Ibeas. A "second round" in lattice basis reduction.
Jaime Gutierrez. A strategy for recovering roots of modular multivariate polynomials.

	Monday	Tuesday	Wednesday	Thursday	Friday
09.00-10.15	A. Dent Introduction to Provable Security	E.Kiltz Public Key Encryption-1	T. Shrimpton Hash Functions-2	V. Lyubashevsky Cryptography and Lattices	K. Paterson The Real World-1
10.15-10.45	Break
10.45-12.00	A. Dent Introduction to Provable Security	G. Neven Digital Signatures-1	X. Boyen Pairing Based Systems-1	X. Boyen Pairing Based Systems-2	B. Warinschi Symbolic Methods-2
12.15-13.30	P. Rogaway Symmetric Techniques-1	E.Kiltz Public Key Encryption-2	G. Neven Digital Signatures-2	B. Blanchet Automating Security Proofs-1	B. Blanchet Automating Security Proofs-2
13.30-15.15	Lunch
15.15-16.30	P. Rogaway Symmetric Techniques-2	T. Shrimpton Hash Functions-1	V. Lyubashevsky Cryptography and Lattices	B. Warinschi Symbolic Methods-1	K. Paterson The Real World-2
16.30-17.30	Problems Session				End