EUROCRYPT 2013:

Phong Q. Nguyen and Thomas Johansson (Eds.):
Advances in Cryptology - EUROCRYPT 2013,
32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques,
Athens, Greece,
May 26-30, 2013
Proceedings.

• Candidate Multilinear Maps from Ideal Lattices , 1-17, Shai Halevi , Craig Gentry , Sanjam Garg
  bib info
• Lossy Codes and a New Variant of the Learning-With-Errors Problem , 18-34, Jörn Müller-Quade , Nico Döttling
  bib info
• A Toolkit for Ring-LWE Cryptography , 35-54, Chris Peikert , Oded Regev , Vadim Lyubashevsky
  bib info
• Regularity of Lossy RSA on Subdomains and Its Applications , 55-75, Adam Smith , Adam O'Neill , Mark Lewko
  bib info
• Efficient Cryptosystems from 2 ^k -th Power Residue Symbols , 76-92, Benoît Libert , Marc Joye
  bib info
• Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions , 93-110, Salil P. Vadhan , Gil Segev , Ananth Raghunathan
  bib info
• How to Watermark Cryptographic Functions , 111-125, Ryo Nishimaki
  bib info
• Security Evaluations beyond Computing Power , 126-141, François-Xavier Standaert , Nicolas Veyrat-Charvillon , Benoît Gérard
  bib info
• Masking against Side-Channel Attacks: A Formal Security Proof , 142-159, Emmanuel Prouff , Matthieu Rivain
  bib info
• Leakage-Resilient Cryptography from Minimal Assumptions , 160-176, Hoeteck Wee , Carmit Hazay , Daniel Wichs , Adriana López-Alt
  bib info
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields , 177-193, Antoine Joux
  bib info
• Fast Cryptography in Genus 2 , 194-210, Kristin Lauter , Joppe W. Bos , Craig Costello , Hüseyin Hisil
  bib info
• Graph-Theoretic Algorithms for the "Isomorphism of Polynomials" Problem , 211-227, Pierre-Alain Fouque , Charles Bouillaguet , Amandine Véber
  bib info
• Cryptanalysis of Full RIPEMD-128 , 228-244, Thomas Peyrin , Franck Landelle
  bib info
• New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis , 245-261, Marc Stevens
  bib info
• Improving Local Collisions: New Attacks on Reduced SHA-256 , 262-278, Florian Mendel , Martin Schläffer , Tomislav Nad
  bib info
• Dynamic Proofs of Retrievability via Oblivious RAM , 279-295, David Cash , Daniel Wichs , Alptekin Küpçü
  bib info
• Message-Locked Encryption and Secure Deduplication , 296-312, Mihir Bellare , Thomas Ristenpart , Sriram Keelveedhi
  bib info
• Keccak , 313-314, Joan Daemen , Guido Bertoni , Michael Peeters , Gilles Van Assche
  bib info
• Batch Fully Homomorphic Encryption over the Integers , 315-335, Jean-Sébastien Coron , Jung Hee Cheon , Aaram Yun , Moon Sung Lee , Mehdi Tibouchi , Jinsu Kim , Tancrède Lepoint
  bib info
• Practical Homomorphic MACs for Arithmetic Circuits , 336-352, Dario Catalano , Dario Fiore
  bib info
• Streaming Authenticated Data Structures , 353-370, Roberto Tamassia , Elaine Shi , Charalampos Papamanthou , Ke Yi
  bib info
• Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting , 371-387, Pierre-Alain Fouque , Patrick Derbez , Jérémy Jean
  bib info
• New Links between Differential and Linear Cryptanalysis , 388-404, Kaisa Nyberg , Céline Blondeau
  bib info
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption , 405-425, Jooyoung Lee
  bib info
• Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures , 444-460, Marc Fischlin , Nils Fleischhacker
  bib info
• Practical Signatures from Standard Assumptions , 461-485, Dennis Hofheinz , Jae Hong Seo , Tibor Jager , Jessica Koch , Christoph Striecks , Florian Böhl
  bib info
• Locally Computable UOWHF with Linear Shrinkage , 486-502, Benny Applebaum , Yoni Moses
  bib info
• Amplification of Chosen-Ciphertext Security , 503-519, Stefano Tessaro , Huijia Lin
  bib info
• Circular Chosen-Ciphertext Security with Compact Ciphertexts , 520-536, Dennis Hofheinz
  bib info
• MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions , 537-556, Jesper Buus Nielsen , Claudio Orlandi , Peter Sebastian Nordholt , Tore Kasper Frederiksen , Thomas Pelle Jakobsen
  bib info
• How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation , 557-574, Payman Mohassel , Seyed Saeed Sadeghian
  bib info
• Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction , 575-591, Tal Malkin , Hoeteck Wee , Mike Rosulek , S. Dov Gordon
  bib info
• Quantum-Secure Message Authentication Codes , 592-608, Dan Boneh , Mark Zhandry
  bib info
• One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games , 609-625, Serge Fehr , Stephanie Wehner , Marco Tomamichel , Jedrzej Kaniewski
  bib info
• Quadratic Span Programs and Succinct NIZKs without PCPs , 626-645, Rosario Gennaro , Craig Gentry , Bryan Parno , Mariana Raykova
  bib info
• Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists , 646-663, Jens Groth , Stephanie Bayer
  bib info
• Resource-Restricted Indifferentiability , 664-683, Martin Hirt , Peter Gazi , Gregory Demay , Ueli Maurer
  bib info
• On Concurrently Secure Computation in the Multiple Ideal Query Model , 684-701, Vipul Goyal , Abhishek Jain
  bib info
• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions , 702-718, Ivan Visconti , Rafail Ostrovsky , Akshay Wadia , Alessandra Scafuro
  bib info
• How to Garble RAM Programs , 719-734, Rafail Ostrovsky , Steve Lu
  bib info