  |
  |
 |
 |
 |
  |
 |
 |
 |
Eurocrypt 2013 Program
The social program will include a welcome reception on Sunday at the roof top of the conference hotel, dinner on your own on monday evening
that will be coordinated by the conference local committee and a rump session on Tuesday evening at the hotel.
The conference gala dinner on Wednesday evening will be replaced by a standing event at the Acropolis museum.
that will include food, drink and a private tour of the museum.
The conference will be preceded by an optional day excursion in the beautiful town of Nafplio outside of Athens.
Registration: The registration and conference helpers desk is located in front of the Olympia hall at Caravel. It will remain open from 4pm to 8pm on Sunday 26 of May, 8am-6pm Monday to Wednesday and 8am-2pm on Thursday the 30th.
| Sunday, May 26 | |
|---|---|
| 8:30 | Departure for Nafplio - Caravel hotel lobby |
| 16:00 | Registration opens - Caravel Olympia Hall |
| 19:30–22:00 | Welcome Reception |
| Monday, May 27 | |
| 08:50–9:00 | Welcome |
| 9:00–10:20 | Lattices (Chair: Phong Nguyen) |
| Candidate Multilinear Maps from Ideal Lattices (BEST PAPER)
Sanjam Garg (UCLA, USA), Craig Gentry (IBM, USA) and Shai Halevi (IBM, USA) | |
| Lossy Codes and a New Variant of the Learning-With-Errors Problem
Nico Döttling and Jörn Müller-Quade (Karlsruhe Institute of Technology, Germany) | |
| A Toolkit for Ring-LWE Cryptography
Vadim Lyubashevsky (INRIA and ENS, France), Chris Peikert (Georgia Institute of Technology, USA) and Oded Regev (Courant Institute NYU, USA) | |
| 10:20–10:45 | Break |
| 10:45–12:25 | Public-key Encryption (Chair: Phil Rogaway) |
| Regularity of Lossy RSA on Subdomains and its Applications
Mark Lewko (UCLA, USA), Adam O'Neill (Boston University, USA) and Adam Smith (Pennsylvania State University, USA) | |
| Efficient Cryptosystems from 2^k-th Power Residue Symbols
Marc Joye and Benoit Libert (Technicolor, France) | |
| Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
Ananth Raghunathan (Stanford University, USA), Gil Segev (Microsoft Research Silicon Valley, USA) and Salil Vadhan (Harvard University, USA) | |
| How to Watermark Cryptographic Functions
Ryo Nishimaki (NTT, Japan) | |
| 12:25–14:00 | Lunch |
| 14:00–15:15 | Side-channel Attacks (Chair: Frederik Armknecht) |
| Security Evaluations Beyond Computing Power: How to Analyze Side-Channel Attacks you Cannot Mount?
Nicolas Veyrat-Charvillon (Universitè catholique de Louvain, Belgium), Benoót Gèrard (DGA-MI, France and Universitè catholique de Louvain, Belgium) and Franáois-Xavier Standaert (Universitè catholique de Louvain, Belgium) | |
| Masking against Side Channel Attacks: a Formal Security Proof
Emmanuel Prouff (ANSSI, France) and Matthieu Rivain (CryptoExperts, France) | |
| Leakage-Resilient Cryptography from Minimal Assumptions
Carmit Hazay (Bar Ilan University, Israel), Adriana Lopez-Alt (New York University, USA), Hoeteck Wee (George Washington University, USA) and Daniel Wichs (Northeastern University, USA) | |
| 15:15–15:40 | Break |
| 15:40–16:55 | Number Theory (Chair: Nigel Smart) |
| Faster index calculus for the medium prime case. Application to 1175-bit and 1425-bit finite fields
Antoine Joux (CryptoExperts and UVSQ, France) | |
| Fast cryptography in genus 2
Joppe W. Bos (Microsoft Research, USA), Craig Costello (Microsoft Research, USA), Huseyin Hisil (Yasar University, Turkey), and Kristin Lauter (Microsoft Research, USA) | |
| Graph-Theoretic Algorithms for the Isomorphism of Polynomials Problem
Charles Bouillaguet (University of Lille-1, France), Pierre-Alain Fouque (University of Rennes-1, France) and Amandine Vèber (École Polytechnique, France) | |
| Tuesday, May 28 | |
| 9:00–10:15 | Cryptanalysis of Hash Functions (Chair: Bart Preneel) |
| Cryptanalysis of Full RIPEMD-128
Franck Landelle (DGA-MI, France) and Thomas Peyrin (Nanyang Technological University, Singapore) | |
| New collision attacks on SHA-1 based on optimal joint local-collision analysis
Marc Stevens (CWI Amsterdam, Netherlands) | |
| Improving Local Collisions: New Attacks on Reduced SHA-256
Florian Mendel, Tomislav Nad and Martin Schläffer (Graz University of Technology, Austria) | |
| 10:15–10:40 | Break |
| 10:40–11:30 | Storage (Chair: Thomas Johansson) |
| Dynamic Proofs of Retrievability via Oblivious RAM
David Cash (Rutgers University, USA), Alptekin Kupcu (Koc University, Turkey) and Daniel Wichs (Northeastern University, USA) | |
| Message-Locked Encryption and Secure Deduplication
Mihir Bellare (UC San Diego, USA), Sriram Keelveedhi (UC San Diego, USA) and Thomas Ristenpart (University of Wisconsin, USA) | |
| 11:30–12:30 | Invited talk: Keccak Guido Bertoni, Joan Daemen, Michaël Peeters and Gilles Van Assche |
| 12:30–14:00 | Lunch |
| 14:00–15:15 | Homomorphic Cryptography (Chair: Vadim Lyubashevsky) |
| Batch Fully Homomorphic Encryption over the Integers
Jung Hee Cheon (Seoul National University, Korea), Jean-Sèbastien Coron (Tranef, France), Jinsu Kim (Seoul National University, Korea), Moon Sung Lee (Seoul National University, Korea), Tancrëde Lepoint (CryptoExperts and ENS, France), Mehdi Tibouchi (NTT Secure Platform Laboratories, Japan), and Aaram Yun (Ulsan National Institute of Science and Technology, Korea). | |
| Practical Homomorphic MACs for Arithmetic Circuits
Dario Catalano (UniversitË di Catania, Italy) and Dario Fiore (MPI-SWS, Germany) | |
| Streaming Authenticated Data Structures
Charalampos Papamanthou (UC Berkeley, USA), Elaine Shi (University of Maryland, USA), Roberto Tamassia (Brown University, USA) and Ke Yi (HKUST, China) | |
| 15:15–15:40 | Break |
| 15:40–17:20 | Block Ciphers (Chair: Gregor Leander) |
| Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting
Patrick Derbez (ENS, France), Pierre-Alain Fouque (University of Rennes-1, France) and Jeremy Jean (ENS, France) | |
| New Links Between Differential and Linear Cryptanalysis
Cèline Blondeau and Kaisa Nyberg (Aalto University School of Science, Finland) | |
| Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
Jooyoung Lee (Sejong University, Korea) | |
| Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
Paul Baecher, Pooya Farshim, Marc Fischlin (TU Darmstadt, Germany) and Martijn Stam (University of Bristol, UK) | |
| 19:00– | Rump Session Program can be found here |
| Wednesday, May 29 | |
| 9:00–10:15 | Digital Signatures (Chair: Miyako Ohkubo) |
| Limitations of the Meta-Reduction Technique: The Case of Schnorr Signatures
Marc Fischlin (TU Darmstadt, Germany) and Nils Fleischhacker (Saarland University, Germany) | |
| Practical Signatures From Standard Assumptions
Florian Böhl and Dennis Hofheinz (Karlsruhe Institute of Technology, Germany), Tibor Jager (Ruhr-Universität Bochum, Germany), Jessica Koch (Karlsruhe Institute of Technology, Germany), Jae Hong Seo (NICT, Japan), and Christoph Striecks (Karlsruhe Institute of Technology, Germany) | |
| Locally Computable UOWHF with Linear Shrinkage
Benny Applebaum and Yoni Moses (Tel Aviv University, Israel) | |
| 10:15–10:40 | Break |
| 10:40–11:30 | Public Key Encryption (Chair: Eike Kiltz |
| Amplification of Chosen-Ciphertext Security
Huijia Lin (MIT and Boston University, USA) and Stefano Tessaro (MIT, USA) | |
| Circular chosen-ciphertext security with compact ciphertexts
Dennis Hofheinz (Karlsruhe Institute of Technology, Germany) | |
| 11:30–12:30 | The 2013 IACR Distinguished Lecture talk: (Chair: Bart Preneel) How to Make a Difference: 25 Years of Differential Cryptanalysis Eli Biham |
| 12:30–14:00 | Lunch |
| 14:00–15:15 | Secure Computation (Chair: abhi shelat) |
| MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions
Tore Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt and Claudio Orlandi (Aarhus University, Denmark) | |
| How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation
Payman Mohassel and Saeed Sadeghian (University of Calgary, Canada) | |
| Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction
Dov Gordon (Applied Communication Sciences, USA), Tal Malkin (Columbia University, USA), Mike Rosulek (University of Montana, USA) and Hoeteck Wee (George Washington University, USA) | |
| 15:15–15:40 | Break |
| 15:40–16:35 | Quantum Cryptography (Chair: Eike Kiltz) |
| Quantum-Secure Message Authentication Codes
Dan Boneh and Mark Zhandry (Stanford University, USA) | |
| One-Sided Device-Independent QKD and Position-based Cryptography from Monogamy Games
Marco Tomamichel (CQT, Singapore), Serge Fehr (CWI, Amsterdam), Jedrzej Kaniewski (CQT, Singapore) and Stephanie Wehner (CQT, Singapore) | |
| 16:35–17:35 | IACR Membership Meeting |
| 19:00 | Departure for the Acropolis Museum event |
| Thursday, May 30 | |
| 9:00–10:15 | Tools (Chair: Giuseppe Persiano) |
| Quadratic Span Programs and Succinct NIZKs without PCPs
Rosario Gennaro (City College of New York, USA), Craig Gentry (IBM, USA), Bryan Parno (Microsoft Research, USA) and Mariana Raykova (IBM, USA) | |
| Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists
Stephanie Bayer and Jens Groth (University College London, USA) | |
| Resource-Restricted Indifferentiability
Gregory Demay, Peter Gazi and Martin Hirt and Ueli Maurer (ETH Zurich, Switzerland) | |
| 10:15–10:40 | Break |
| 10:40–11:55 | Secure Computation (Chair: Jens Groth) |
| On Concurrently Secure Computation in the Multiple Ideal Query Model
Vipul Goyal (Microsoft Research, India) and Abhishek Jain (MIT and BU, USA) | |
| Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
Rafail Ostrovsky, Alessandra Scafuro (UCLA, USA), Ivan Visconti (University of Salerno, Italy) and Akshay Wadia (UCLA, USA) | |
| How to Garble RAM Programs
Steve Lu (Stealth, USA) and Rafail Ostrovsky (UCLA, USA) | |
| 12:00 | Farewell snack |