Please let us know if you arrive late on Sunday by sending a mail to Eleonora Campori ecampori@ceub.it.

Final Program

Sunday, 24 May 2009

15:00 - 20:00 Opening Reception, University Residential Center (via Frangipane, 4)
20:30 Welcome Buffet - Canteen

Monday, 25 May 2009

7:30-8:45

Breakfast - Canteen
9:00-10:20 The Group of Signed Quadratic Residues and Applications   Dennis Hofheinz
Security Proofs for OAEP in the Standard Model   Eike Kiltz

10:20-10:50

Coffee Break
10:50-12:10 Omission-corruption in Secure Multi-Party Computation   Vassilis Zikas
Multi-Party Computation over Reals   Matthias Fitzi
Adaptively Secure Broadcast   Martin Hirt

12:30-13:30

Lunch - Canteen
14:30-16:30 Extracting Correlations   Yuval Ishai
Definitions of Computational Soundness   Dominique Unruh
Parallel Repetition Theorems   Douglas Wikstrom

16:30-17:00

Coffee Break
17:00-18:20 Anonymizer-Enabled Security and Privacy for Low-Cost RFID Systems Christian Wachsmann
Generalized Private Circuits Sebastian Faust

18:20

End
20:00 Dinner - Restaurant (La Grotta, via Roma 37)

Tuesday, 26 May 2009

7:30-8:45

Breakfast - Canteen
9:00-10:20 Leakage-Resilient Public-Key Cryptography Krystof Pietrzak
Public-Key Cryptography in the Bounded Retrieval Model Yevgeniy Dodis

10:20-10:50

Coffee Break
10:50-12:10 PET SNAKE: Implementing an Algebraic Attack in Hardware? Rainer Steinwandt
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint Alexander May
Towards Secure Physical Layer Key Exchange Joern Mueller-Quade

12:30-13:30

Lunch - Canteen
14:30-16:30 Chosen-Ciphertext Security via Correlated Products Alon Rosen
Verifiable Random Functions from Identity based Encapsulation Dario Catalano
TBD Xavier Boyen

16:30-17:00

Coffee Break
17:00-18:20 On Key Management Christian Cachin
Non-Interactive Computation of Pairwise Keys in Group Diffie-Hellman Protocols Mark Manulis

18:20

End
19:00 Visit to Inter-Faith Museum
20:00 Dinner - Canteen

Wednesday, 27 May 2009

7:30-8:45

Breakfast - Canteen
9:00-10:20 Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP Rebecca Wright
Collusion-Free Computation in the Mediated Model Ivan Visconti
Leakage Resilient Stream Ciphers Stefan Dziembowski

10:20-10:50

Coffee Break
10:50-12:20 Equivalence of Key Agreement and Composition Insecurity Rafail Ostrovsky
Delayed-Key Message Authentication Marc Fischlin
Randomizable Proofs and Delegatable Anonymous Credentials Melissa Chase

12:30-13:30

Lunch - Canteen
14:00 Departure for Sightseeing tour to Urbino (with Dinner - Restaurant)

Thursday, 28 May 2009

7:30-8:45

Breakfast - Canteen
9:00-10:10 60 Years of Scientific Research in Cryptography: a Reflection Yvo Desmedt
The Bertinoro Dilemma Tal Malkin

10:10-10:40

Coffee Break
10:40-12:30 Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Juan Garay
A Zero-One Law for 2-party Computation Manoj Prabhakaran
Oblivious Pseudorandom Functions and Secure Computation of Set Intersection Stanislaw Jarecki

12:30-13:30

Lunch - Canteen
14:30-16:30 Key Agreement from Close Secrets over Unsecured Channels Leonid Reyzin
Sampling in a Quantum Population, and Applications Serge Fehr
Computational Differential Privacy and Its Relevance to Protocol Design Ilya Mironov

16:30-17:00

Coffee Break
17:00-18:20 Universally Composable Analysis of TLS Sebastian Gajek
Practical Secure Evaluation of Semi-Private Functions   Thomas Schneider

18:20

End
20:00 Dinner - Restaurant (Casina Pontormo, via dei Cappuccini 46)

Friday, 29 May 2009

7:30-8:45

Breakfast - Canteen
9:00-10:20 Efficient Secrets from Relativity Stefan Wolf
Secret Sharing and Non-Shannon Information Inequalities   Amos Beimel

10:20-10:40

Coffee Break
10:40-12:00 History-Free Sequential Aggregation Dominique Schröder
Traditori di Bertinoro Distrutti Aggelos Kiayias

12:00

Lunch - Canteen

Last modified Friday 29-May-2009 12:12:32 CET.