Monday, April 16, 2012
08.30 Registration Desk is opened
09.00 Welcome/Opening Remarks
Nigel Smart
 
Session 1 Index Calculus
Chair: Eike Kiltz
09.10 Best Paper: Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a previously unreachable curve over Fp6
Antoine Joux and Vanessa Vitse (DGA and Université Versailles Saint-Quentin)
09.50 Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Jean-Charles Faugère, Ludovic Perret, Christophe Petit, and Guénaël Renault (UPMC, INRIA France, and UCL Belgium)
 
10.15 Coffee Break
 
Session 2 Symmetric Constructions - I
Chair: Aggelos Kiayias
10.40 Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Francois-Xavier Standaert, John Steinberger, and Elmar Tischhauser (KUL, UCL Belgium, DTU Denmark, and Tsinghua University)
11.05 Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
Peter Gazi and Stefano Tessaro (ETH Zurich, Comenius University Bratislava, and UC San Diego)
Session 3 Invited Talk
Chair: Thomas Johansson
11.30 A Tutorial on High Performance Computing applied to Cryptanalysis
Antoine Joux (DGA and Université Versailles Saint-Quentin)
 
12.30 Lunch (Robinson College)
 
Session 4 Secure Computation
Chair: Yehuda Lindell
14.00 Fair Computation with Rational Players
Adam Groce and Jonathan Katz (University of Maryland)
14.25 Concurrently Secure Computation in Constant Rounds
Sanjam Garg, Vipul Goyal, Abhishek Jain, and Amit Sahai (UC Los Angeles, and MSR India)
14.50 Identity-Based Encryption Resilient to Continual Auxiliary Leakage
Tsz Hon Yuen, Sherman S. M. Chow, Ye Zhang, and Siu Ming Yiu (The University of Hong Kong, University of Waterloo, and Pennsylvania State University)
 
15.15 Coffee Break
 
Session 5 Protocols
Chair: Jens Groth
15.45 Quantum Proofs of Knowledge
Dominique Unruh (University of Tartu)
16.10 On Round-Optimal Zero Knowledge in the Bare Public-Key Model
Alessandra Scafuro and Ivan Visconti (University of Salerno)
16.35 Robust Coin Flipping
Gene Kopp and John Wiltshire-Gordon (University of Michigan)
17.00 Unconditionally-Secure Robust Secret Sharing with Compact Shares
Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, and Yuval Rabani (Leiden University, CWI Amsterdam, UC Los Angeles, and Hebrew University of Jerusalem)