Papers Accepted to

CRYPTO 2011

Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. Masayuki Abe (NTT Information Sharing Platform Labs), Jens Groth (University College London), Kristiyan Haralambiev (NYU), and Miyako Ohkubo (NICT).

Perfectly-Secure Multiplication for any t < n/3. Gilad Asharov (Department of Computer Science, Bar-Ilan University, Israel), Yehuda Lindell (Department of Computer Science, Bar-Ilan University, Israel), and Tal Rabin (IBM T. J. Watson Research Center, NY).

Random Oracle Reducibility. Paul Baecher and Marc Fischlin (both of CASED & TU Darmstadt, Germany).

Leftover Hash Lemma, Revisited. Boaz Barak (Microsoft Research, New England, USA), Yevgeniy Dodis (New York University), Hugo Krawczyk (IBM T.J. Watson Research Center), Olivier Pereira (UCL Crypto Group, Université catholique de Louvain), Krzysztof Pietrzak (CWI Amsterdam), Francois-Xavier Standaert (UCL Crypto Group, Université catholique de Louvain), and Yu Yu (Department of Computer Science, East China Normal University).

Computer-Aided Security Proofs for the Working Cryptographer. Gilles Barthe (IMDEA Software Institute), Benjamin Gregoire (INRIA Sophia-Antipolis Mediterranee ), Sylvain Heraud (INRIA Sophia-Antipolis Mediterranee ), and Santiago Zanella-Beguelin (IMDEA Software Institute).

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. Amos Beimel (Ben-Gurion University), Yehuda Lindell (Bar-Ilan University), Eran Omri (Bar-Ilan University), and Ilan Orlov (Ben Gurion University).

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. Mihir Bellare and Sriram Keelveedhi (both of UCSD).

Verifiable Delegation of Computation over Large Datasets. Siavosh Benabbas (University of Toronto), Rosario Gennaro (IBM T.J.Watson Research Center), and Yevgeniy Vahlis (Columbia University).

Smaller Decoding Exponents: Ball-Collision Decoding. Daniel J. Bernstein (University of Illinois at Chicago), Tanja Lange (Technische Universiteit Eindhoven), and Christiane Peters (Technische Universiteit Eindhoven).

Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions. Alexandra Boldyreva (Georgia Tech), Nathan Chenette (Georgia Tech), and Adam O’Neill (University of Texas at Austin).

Automatic Search of Attacks on Round-Reduced AES and Applications. Charles Bouillaguet, Patrick Derbez, and Pierre-Alain Fouque (all of Ecole Normale Supérieure, Paris, France)

Better Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. Zvika Brakerski (Weizmann Institute) and Gil Segev (Microsoft Research Silicon Valley).

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. Zvika Brakerski (Weizmann Institute and MIT) and Vinod Vaikuntanathan (Microsoft Research and University of Toronto).

Merkle Puzzles in a Quantum World. Gilles Brassard (Université de Montréal), Peter Høyer (University of Calgary), Kassem Kalach (Université de Montréal), Marc Kaplan (Université de Montréal), Sophie Laplante (LRI – Université Paris-Sud), and Louis Salvail (Université de Montréal).

Physically Uncloneable Functions in the Universal Composition. Christina Brzuska, Marc Fischlin, Heike Schroeder, and Stefan Katzenbeisser (all of TU Darmstadt CASED).

Position-Based Quantum Cryptography: Impossibility and Constructions. Harry Buhrman (CWI and University of Amsterdam), Nishanth Chandran (UCLA), Serge Fehr (CWI), Ran Gelles (UCLA), Vipul Goyal (Microsoft Research, India), Rafail Ostrovsky (UCLA), and Christian Schaffner (University of Amsterdam and CWI).

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. Ignacio Cascudo (CWI Amsterdam), Ronald Cramer (CWI Amsterdam and Leiden University), and Chaoping Xing (NTU Singapore).

Memory Delegation. Kai-Min Chung (Cornell), Yael Kalai (Microsoft Research), Feng-Hao Liu (Brown), and Ran Raz (Weizmann)

Fully-Homomorphic Encryption over the Integers with Shorter Public-Keys. Jean-Sébastien Coron (University of Luxembourg), Avradip Mandal (University of Luxembourg), David Naccache (ENS), and Mehdi Tibouchi (ENS and University of Luxembourg).

Inverting the HFE systems is Quasipolynomial for all Fields. Jintai Ding (South China University of Technology and University of Cincinnati) and Timothy Hodges (University of Cincinnati).

McEliece and Niederreiter Cryptosystems that Resist Quantum Fourier Sampling. Hang Dinh (Indiana University South Bend), Cristopher Moore (University of New Mexico), and Alexander Russell (University of Connecticut).

Key-Evolution Schemes Resilient to Space-Bounded Leakage. Stefan Dziembowski (University of Warsaw and University of Rome “La Sapienza”), Tomasz Kazana (BioInfoBank Institute and University of Warsaw), and Daniel Wichs (New York University).

Leakage-Resilient Zero Knowledge. Sanjam Garg, Abhishek Jain, and Amit Sahai (all of UCLA).

Round Optimal Blind Signatures. Sanjam Garg (UCLA), Vanishree Rao (UCLA), Amit Sahai (UCLA), Dominique Schröder (University of Maryland, USA), and Dominique Unruh (University of Tartu, Estonia).

The PHOTON Family of Lightweight Hash Functions. Jian Guo (Institute for Infocomm Research, Singapore), Thomas Peyrin (Nanyang Technological University, Singapore), and Axel Poschmann (Nanyang Technological University, Singapore).

Secure Computation on the Web: Computing without Simultaneous Interaction. Shai Halevi (IBM Research), Yehuda Lindell (Bar-Ilan University), Benny Pinkas (Bar-Ilan University).

Classical Cryptographic Protocols in a Quantum World. Sean Hallgren, Adam Smith, and Fang Song (all of Pennsylvania State University).

Analyzing Blockwise Lattice Algorithms using Dynamical Systems. Guillaume Hanrot (ENS Lyon), Xavier Pujol (ENS Lyon), and Damien Stehle (CNRS).

Constant-Rate Oblivious Transfer from Noisy Channels. Yuval Ishai (Technion), Eyal Kushilevitz (Technion), Rafail Ostrovsky (UCLA), Manoj Prabhakaran (UIUC), Amit Sahai (UCLA), and Juerg Wullschleger (McGill University).

Cryptography with Tamperable and Leaky Memory. Yael Tauman Kalai (Microsoft Research), Bhavana Kanukurthi (Boston University), and Amit Sahai (University of California, Los Angeles).

A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack. Gregor Leander, Mohamed Ahmed Abdelraheem, Hoda AlKhzaimi, and Erik Zenner (all of DTU Mathematics, Denmark).

The Collision Security of Tandem-DM in the Ideal Cipher Model. Jooyoung Lee (Faculty of Mathematics and Statistics, Sejong University, Seoul, Korea), Martijn Stam (Department of Computer Science, University of Bristol, United Kingdom), and John Steinberger (Institute of Theoretical Computer Science, Tsinghua University, Beijing, China).

The IPS Compiler: Optimizations, Variants and Concrete Efficiency. Yehuda Lindell (Bar-Ilan University), Eli Oxman (Bar-Ilan University), and Benny Pinkas (Bar-Ilan University).

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. Daniele Micciancio and Petros Mol (both of University of California, San Diego).

Time-Lock Puzzles in the Random Oracle Model. Mohammad Mahmoody (Cornell University), Tal Moran and Salil Vadhan (both of Harvard University).

Bi-deniable Public-Key Encryption. Adam O’Neill (University of Texas, Austin), Chris Peikert (Georgia Institute of Technology), and Brent Waters (University of Texas, Austin).

How to Improve Rebound Attacks. Maria Naya-Plasencia (FHNW, Windisch, Switzerland).

Optimal Verification of Operations on Dynamic Sets. Charalampos Papamanthou (Brown University), Roberto Tamassia (Brown University), and Nikos Triandopoulos (RSA Labs and Boston University, USA).

Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials. Koichi Sakumoto, Taizo Shirai, and Harunaga Hiwatari (all of Sony Corporation).

Generic Side-Channel Distinguishers: Improvements and Limitations. Nicolas Veyrat-Charvillon and Francois-Xavier Standaert (both of the UCL Crypto Group, Université catholique de Louvain).

A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework. Carolyn Whitnall (University of Bristol) and Elisabeth Oswald (University of Bristol).

A New Variant of PMAC: Beyond the Birthday Bound. Kan Yasuda (NTT, Japan).