Skip to the navigation. Skip to the content.
EUROCRYPT 2013 in Athens
  • Home
  • Call for Papers
  • Accepted Papers
  • Sponsors
  • Registration
  • Program
  • Rump Session
  • Contact
  • Travelling
  • Upon Arrival
  • Accommodation
  • Restaurants
  • Stipends
  • Excursion


List of Accepted Papers

CRYPTANALYSIS OF HASH FUNCTIONS (3)


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 and Tomislav Nad and Martin Schläffer (Graz University of Technology, Austria)


BLOCK CIPHERS (4)


Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting
Patrick Derbez (ENS, France) and Pierre-Alain Fouque (University of Rennes-1, France) and Jèrèmy 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 and Pooya Farshim and Marc Fischlin (TU Darmstadt, Germany) and Martijn Stam (University of Bristol, UK)


SIDE-CHANNEL ATTACKS (3)


Security Evaluations Beyond Computing Power: How to Analyze Side-Channel Attacks you Cannot Mount?
Nicolas Veyrat-Charvillon (Universitè catholique de Louvain, Belgium) and 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) and Adriana Lopez-Alt (New York University, USA) and Hoeteck Wee (George Washington University, USA) and Daniel Wichs (Northeastern University, USA)


NUMBER THEORY (3)


Faster index calculus for the medium prime case. Application to a 1425-bit finite field.
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) and Pierre-Alain Fouque (University of Rennes-1, France) and Amandine Vèber (École Polytechnique, France)


LATTICES (3)


Candidate Multilinear Maps from Ideal Lattices and Applications
Sanjam Garg (UCLA, USA) and Craig Gentry (IBM, USA) and Shai Halevi (IBM, USA)

A Toolkit for Ring-LWE Cryptography
Vadim Lyubashevsky (INRIA and ENS, France) and Chris Peikert (Georgia Institute of Technology, USA) and Oded Regev (Courant Institute NYU, 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)


PUBLIC KEY ENCRYPTION (6)


Efficient Cryptosystems from 2^k-th Power Residue Symbols
Marc Joye and Benoit Libert (Technicolor, France)

Amplification of Chosen-Ciphertext Security
Huijia Lin (MIT and Boston University, USA) and Stefano Tessaro (MIT, USA)

Regularity of Lossy RSA on Subdomains and its Applications
Mark Lewko (UCLA, USA) and Adam O'Neill (Boston University, USA) and Adam Smith (Pennsylvania State University, USA)

Breaking the Adaptivity Barrier for Deterministic Public-Key Encryption
Ananth Raghunathan (Stanford University, USA) and Gil Segev (Microsoft Research Silicon Valley, USA) and Salil Vadhan (Harvard University, USA)

Circular chosen-ciphertext security with compact ciphertexts
Dennis Hofheinz (Karlsruhe Institute of Technology, Germany)

How to Watermark Cryptographic Functions?
Ryo Nishimaki (NTT, Japan)


DIGITAL SIGNATURES (3)


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)


HOMOMORPHIC CRYPTOGRAPHY (3)


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) and Elaine Shi (University of Maryland, USA) and Roberto Tamassia (Brown University, USA) and Ke Yi (HKUST, China)


QUANTUM CRYPTOGRAPHY (2)


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) and Serge Fehr (CWI, Amsterdam) and Jedrzej Kaniewski (CQT, Singapore) and Stephanie Wehner (CQT, Singapore)


STORAGE (2)


Dynamic Proofs of Retrievability via Oblivious RAM
David Cash (Rutgers University, USA) and Alptekin Kupcu (Koc University, Turkey) and Daniel Wichs (Northeastern University, USA)

Message-Locked Encryption and Secure Deduplication
Mihir Bellare (UC San Diego, USA) and Sriram Keelveedhi (UC San Diego, USA) and Thomas Ristenpart (University of Wisconsin, USA)


TOOLS (3)


Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists
Stephanie Bayer and Jens Groth (University College London, USA)

Quadratic Span Programs and Succinct NIZKs without PCPs
Rosario Gennaro (City College of New York, USA) and Craig Gentry (IBM, USA) and Bryan Parno (Microsoft Research, USA) and Mariana Raykova (IBM, USA)

Resource-Restricted Indifferentiability
Gregory Demay and Peter Gazi and Martin Hirt and Ueli Maurer (ETH Zurich, Switzerland)


SECURE COMPUTATION (6)


Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction
Dov Gordon (Applied Communication Sciences, USA) and Tal Malkin (Columbia University, USA) and Mike Rosulek (University of Montana, USA) and Hoeteck Wee (George Washington University, USA)

How to Hide Circuits in MPC: An Efficient Framework for Private Function Evaluation
Payman Mohassel and Saeed Sadeghian (University of Calgary, Canada)

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
Rafail Ostrovsky and Alessandra Scafuro (UCLA, USA) and Ivan Visconti (University of Salerno, Italy) and Akshay Wadia (UCLA, USA)

On Concurrently Secure Computation in the Multiple Ideal Query Model
Vipul Goyal (Microsoft Research, India) and Abhishek Jain (MIT and BU, USA)

MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions
Tore Frederiksen and Thomas P. Jakobsen and Jesper Buus Nielsen and Peter Sebastian Nordholt and Claudio Orlandi (Aarhus University, Denmark)

How to Garble RAM Programs
Steve Lu (Stealth, USA) and Rafail Ostrovsky (UCLA, USA)