May 24 - 25, 2007, Barcelona, Spain
Program
The workshop will start Thursday early afternoon right after Eurocrypt 2007 and will end on Friday late afternoon.
Preliminary Schedule
| Thursday, May 24 | |
| Time | Event |
| 14:00 - 14:10 | Opening |
| 14:10 - 15:10 | Invited talk by Eric Rescorla: "Indigestion: Assessing the impact of known and future hash function attacks" Presentation |
| 15:10 - 16:00 | Session 1 Revisiting security relations between signature schemes and their inner hash functions A critical look at cryptographic hash function literature by Scott Contini, Ron Steinfeld, Josef Pieprzyk and
Krystian Matusiewicz (Macquarie University) |
| 16:00 - 16:30 | Break |
| 16:30 - 17:45 | Session 2 MAME: A compression function with reduced hardware requirements by Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, Jun
Kitahara, Hongjun Wu, Ozgul Kucuk and Bart Preneel (Hitachi, Ltd
and Katholieke Universiteit Leuven) Improved fast syndrome based cryptographic hash function by Matthieu Finiasz, Philippe Gaborit and Nicolas
Sendrier (ENSTA, XLIM, University of Limoges and INRIA
Rocquencourt) What output size resists collisions in a xor of independent expansions? by Daniel J. Bernstein (University of Illinois at
Chicago) |
| 19:00 - | Reception |
| Friday, May 25 | |
| Time | Event |
| 09:00 - 10:15 | Session 3 Building application-agile hash functions: the MCM construction by Thomas Ristenpart and Thomas Shrimpton (UC San Diego
and Portland State University) Sponge functions by Guido Bertoni, Joan Daemen, Michaël Peeters and Generalizing the herding attack to concatenated hashing schemes by Orr Dunkelman and Bart Preneel (Katholieke
Universiteit Leuven) |
| 10:15 - 10:45 | Break |
| 10:45 - 12:00 | Session 4 Automatic search of differential path in MD4 by Pierre-Alain Fouque, Gaëtan Leurent and Phong
Nguyen (Ecole Normale Supérieure, Paris) Hash functions and the (amplified) boomerang attack by Antoine Joux and Thomas Peyrin (DGA, France
Télécom R&D and Université de Versailles) On the full cost of collision search for SHA-1 by Christophe De Cannière and Florian Mendel and Christian
Rechberger (Katholieke Universiteit Leuven and Graz University of
Technology) |
| 12:00 - 14:00 | Lunch |
| 14:00 - 15:00 | Invited talk by John Kelsey, NIST: "How to Evaluate a Hash Proposal" Presentation |
| 15:00 - 15:30 | Break |
| 15:30 - 16:45 | Session 5 Three-property preserving iterations of keyless compression functions by Elena Andreeva, Gregory Neven, Bart Preneel and
Thomas Shrimpton (Katholieke Universiteit Leuven and Portland
State University) Domain extensions for random oracles: beyond the birthday-paradox bound by Ilya Mironov and Arvind Narayanan (Microsoft Research
and UT Austin) Efficient collision-resistant hashing from fixed-length random oracles by Thomas Shrimpton and Martijn Stam (Portland State
University and Ecole Polytechnique Federale de Lausanne) |
| 16:45 | Closing |