LIST OF ACCEPTED PAPERS FOR EUROCRYPT 2012
             ------------------------------------------

Efficient Zero-Knowledge Argument for Correctness of a Shuffle 
   Stephanie Bayer and Jens Groth 
   (University College London)

Malleable Proof Systems and Applications 
   Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, and Sarah Meiklejohn 
   (MSR Redmond, MSR Cambridge, Brown University, and UC San Diego)

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting 
   Allison Lewko 
   (UT Austin)

Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption 
   Tatsuaki Okamoto and Katsuyuki Takashima 
   (NTT Japan and Mitsubishi Electric)

Scalable Group Signatures with Revocation 
   Benoit Libert, Thomas Peters and Moti Yung 
   (UCL Belgium, Google Inc. and Columbia University)

All-But-Many Lossy Trapdoor Functions 
   Dennis Hofheinz 
   (Karlsruhe Institute of Technology)

Identity-Based (Lossy) Trapdoor Functions and Applications 
   Mihir Bellare, Eike Kiltz, Chris Peikert, and Brent Waters 
   (UC San Diego,  Ruhr-University Bochum, Georgia Institute of Technology, and UT Austin)

Dual Projective Hashing and its Applications - Lossy Trapdoor Functions and More 
   Hoeteck Wee 
   (George Washington University)

Incremental Deterministic Public-Key Encryption 
   Ilya Mironov, Omkant Pandey, Omer Reingold, and Gil Segev 
   (MSR Silicon Valley and Microsoft Redmond)

Group to Group Commitments Do Not Shrink 
   Masayuki Abe, Kristiyan Haralambiev, and Miyako Ohkubo 
   (NTT Japan, NYU, and NICT)

Optimal Security Proofs for Full Domain Hash, Revisited 
   Saqib A. Kakvi and Eike Kiltz 
   (Ruhr-University Bochum)

On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model 
   Yannick Seurin 
   (ANSSI France)

Tightly-Secure Signatures from Lossy ID Schemes 
   Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, and Mehdi Tibouchi 
   (CNRS, INRIA, ENS, France, and NTT Japan)

Standard Security Does Not Imply Security Against Selective-Opening 
   Mihir Bellare, Rafael Dowsley, Brent Waters, and Scott Yilek 
   (UC San Diego, UT Austin, and the University of St. Thomas)

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security 
   Susan Hohenberger, Allison Lewko, and Brent Waters 
   (Johns Hopkins University and UT Austin)

Quantum Proofs of Knowledge 
   Dominique Unruh 
   (University of Tartu)

On Round-Optimal Zero Knowledge in the Bare Public-Key Model 
   Alessandra Scafuro and Ivan Visconti 
   (University of Salerno)

Trapdoor for Lattices: Simpler, Tighter, Faster, Smaller 
   Daniele Micciancio and Chris Peikert 
   (UC San Diego and Georgia Institute of Technology)

Pseudorandom Functions and Lattices 
   Abhishek Banerjee, Chris Peikert, and Alon Rosen 
   (Georgia Institute of Technology and IDC Herzliya)

Lattice Signatures Without Trapdoors 
   Vadim Lyubashevsky 
   (INRIA, ENS, Paris)

Fully Homomorphic Encryption with Polylog Overhead 
   Craig Gentry, Shai Halevi, and Nigel Smart 
   (IBM Research and University of Bristol)

Public-key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers 
   Jean-Sebastien Coron, David Naccache, and Mehdi Tibouchi 
   (University of Luxembourg, ENS, and NTT Japan)

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE 
   Gilad Asharov, Abhishek Jain,  Adriana Lopez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs 
   (Bar Ilan University, UC Los Angeles, NYU, Tel-Aviv University, University of Toronto, and IBM Research)

Robust Coin Flipping 
   Gene Kopp and John Wiltshire-Gordon 
   (University of Michigan)

Unconditionally-Secure Robust Secret Sharing with Compact Shares 
   Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, and Yuval Rabani 
   (Leiden University, CWI Amsterdam, UC Los Angeles, and Hebrew University of Jerusalem)

Fair Computation with Rational Players 
   Adam Groce and Jonathan Katz 
   (University of Maryland)

Concurrently Secure Computation in Constant Rounds 
   Sanjam Garg, Vipul Goyal, Abhishek Jain, and Amit Sahai 
   (UC Los Angeles, and MSR India)

Identity-Based Encryption Resilient to Continual Auxiliary Leakage 
   Tsz Hon Yuen, Sherman S. M. Chow, Ye Zhang, and Siu Ming Yiu 
   (The University of Hong Kong, University of Waterloo, and Pennsylvania State University)

Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading 
   Peter Gazi and Stefano Tessaro 
   (ETH Zurich, Comenius University Bratislava, and UC San Diego)

Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations 
   Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Francois-Xavier Standaert, John Steinberger, and Elmar Tischhauser 
   (KUL, UCL Belgium, DTU Denmark, and Tsinghua University)

Minimalism in Cryptography: The Even-Mansour Scheme Revisited 
   Orr Dunkelman, Nathan Keller, and Adi Shamir 
   (University of Haifa and Weizmann Institute of Science, Israel)

Message Authentication, Revisited 
   Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, and Daniel Wichs 
   (NYU, Ruhr-University Bochum, IST Austria, and IBM Research)

Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation 
   Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, and Martijn Stam 
   (Georgia Institute of Technology, Royal Holloway University of London, and University of Bristol)

Property Preserving Symmetric Encryption 
   Omkant Pandey and Yannis Rouselakis 
   (Microsoft Redmond and UT Austin)

Narrow Bicliques: Cryptanalysis of Full IDEA 
   Dmitry Khovratovich, Gaetan Leurent, and Christian Rechberger 
   (MSR Redmond, University of Luxembourg, and DTU Denmark)

Cryptanalyses on a Merkle-Damgard Based MAC --- Almost Universal Forgery and Distinguishing-H Attacks 
   Yu Sasaki 
   (NTT)

Statistical Tools Flavor Side-Channel Collision Attacks 
   Amir Moradi 
   (Ruhr-University Bochum)

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers 
   Yuanmi Chen and Phong Q. Nguyen 
   (ENS, INRIA, France, and Tsinghua University)

Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a previously unreachable curve over Fp^6 (Best Paper)
   Antoine Joux and Vanessa Vitse 
   (DGA and Université de Versailles Saint-Quentin)

Decoding Random Binary Linear Codes in 2^(n/20): How 1+1=0 Improves Information Set Decoding 
   Anja Becker, Antoine Joux, Alexander May, and Alexander Meurer 
   (University of Versailles Saint-Quentin-en-Yvelines, DGA, Ruhr-University Bochum)

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields 
   Jean-Charles Faugère, Ludovic Perret, Christophe Petit, and Guénaël Renault 
   (UPMC, INRIA France, and UCL Belgium)