EUROCRYPT 2012:

David Pointcheval and Thomas Johansson (Eds.):
Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques - EUROCRYPT 2012,
Cambridge,
UK,
April 15-19, 2012
Proceedings.
$SPRINGER

• Invited Talks
  • A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract) , 1-7, Antoine Joux
    bib info
  • Another Look at Provable Security , 8, Alfred Menezes
    bib info
• Index Calculus
  • Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over F _{(p ⁶ )} , 9-26, Antoine Joux , Vanessa Vitse
    bib info
  • Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields , 27-44, Jean-Charles Faugère , Ludovic Perret , Christophe Petit , Guènaël Renault
    bib info
• Symmetric Constructions I
  • Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract) , 45-62, Lars R. Knudsen , Gregor Leander , François-Xavier Standaert , Andrey Bogdanov , John P. Steinberger , Elmar Tischhauser
    bib info
  • Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading , 63-80, Stefano Tessaro , Peter Gazi
    bib info
• Secure Computation
  • Fair Computation with Rational Players , 81-98, Jonathan Katz , Adam Groce
    bib info
  • Concurrently Secure Computation in Constant Rounds , 99-116, Vipul Goyal , Amit Sahai , Sanjam Garg , Abhishek Jain
    bib info
  • Identity-Based Encryption Resilient to Continual Auxiliary Leakage , 117-134, Sherman S. M. Chow , Tsz Hon Yuen , Ye Zhang , Siu Ming Yiu
    bib info
• Protocols
  • Quantum Proofs of Knowledge , 135-152, Dominique Unruh
    bib info
  • On Round-Optimal Zero Knowledge in the Bare Public-Key Model , 153-171, Ivan Visconti , Alessandra Scafuro
    bib info
  • Robust Coin Flipping , 172-194, Gene S. Kopp , John D. Wiltshire-Gordon
    bib info
  • Unconditionally-Secure Robust Secret Sharing with Compact Shares , 195-208, Serge Fehr , Rafail Ostrovsky , Alfonso Cevallos , Yuval Rabani
    bib info
  • Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More , 246-262, Hoeteck Wee
    bib info
• Lossy Trapdoor Functions
  • All-But-Many Lossy Trapdoor Functions , 209-227, Dennis Hofheinz
    bib info
  • Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More , 246-262, Hoeteck Wee
    bib info
• Tools
  • Efficient Zero-Knowledge Argument for Correctness of a Shuffle , 263-280, Jens Groth , Stephanie Bayer
    bib info
  • Malleable Proof Systems and Applications , 281-300, Anna Lysyanskaya , Melissa Chase , Markulf Kohlweiss , Sarah Meiklejohn
    bib info
  • Group to Group Commitments Do Not Shrink , 301-317, Masayuki Abe , Miyako Ohkubo , Kristiyan Haralambiev
    bib info
  • Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting , 318-335, Allison B. Lewko
    bib info
• Symmetric Constructions II
  • Minimalism in Cryptography: The Even-Mansour Scheme Revisited , 336-354, Orr Dunkelman , Nathan Keller , Adi Shamir
    bib info
  • Message Authentication, Revisited , 355-374, Eike Kiltz , Krzysztof Pietrzak , Yevgeniy Dodis , Daniel Wichs
    bib info
• Symmetric Cryptanalysis
  • Property Preserving Symmetric Encryption , 375-391, Omkant Pandey , Yannis Rouselakis
    bib info
  • Narrow-Bicliques: Cryptanalysis of Full IDEA , 392-410, Christian Rechberger , Gaëtan Leurent , Dmitry Khovratovich
    bib info
  • Cryptanalyses on a Merkle-Damgård Based MAC - Almost Universal Forgery and Distinguishing-H Attacks , 411-427, Yu Sasaki
    bib info
• Fully Homomorphic Encryption
  • Statistical Tools Flavor Side-Channel Collision Attacks , 428-445, Amir Moradi
    bib info
  • Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers , 446-464, Jean-Sébastien Coron , David Naccache , Mehdi Tibouchi
    bib info
  • Fully Homomorphic Encryption with Polylog Overhead , 465-482, Shai Halevi , Craig Gentry , Nigel P. Smart
    bib info
  • Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 483-501, Eran Tromer , Vinod Vaikuntanathan , Daniel Wichs , Gilad Asharov , Abhishek Jain , Adriana López-Alt
    bib info
• Asymmetric Cryptanalysis
  • Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers , 502-519, Phong Q. Nguyen , Yuanmi Chen
    bib info
  • Decoding Random Binary Linear Codes in 2 ^n/20 : How 1 + 1 = 0 Improves Information Set Decoding , 520-536, Antoine Joux , Alexander May , Alexander Meurer , Anja Becker
    bib info
• Efficient Reductions
  • Optimal Security Proofs for Full Domain Hash, Revisited , 537-553, Eike Kiltz , Saqib A. Kakvi
    bib info
  • On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model , 554-571, Yannick Seurin
    bib info
  • Tightly-Secure Signatures from Lossy Identification Schemes , 572-590, Michel Abdalla , Pierre-Alain Fouque , Vadim Lyubashevsky , Mehdi Tibouchi
    bib info
• Public-Key Schemes
  • Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption , 591-608, Tatsuaki Okamoto , Katsuyuki Takashima
    bib info
  • Scalable Group Signatures with Revocation , 609-627, Benoít Libert , Moti Yung , Thomas Peters
    bib info
  • Incremental Deterministic Public-Key Encryption , 628-644, Ilya Mironov , Omer Reingold , Gil Segev , Omkant Pandey
    bib info
• Security Models
  • Standard Security Does Not Imply Security against Selective-Opening , 645-662, Mihir Bellare , Brent Waters , Scott Yilek , Rafael Dowsley
    bib info
  • Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security , 663-681, Susan Hohenberger , Brent Waters , Allison B. Lewko
    bib info
  • Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation , 682-699, Kenneth G. Paterson , Alexandra Boldyreva , Martijn Stam , Jean Paul Degabriele
    bib info
• Lattices
  • Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 700-718, Daniele Micciancio , Chris Peikert
    bib info
  • Pseudorandom Functions and Lattices , 719-737, Chris Peikert , Alon Rosen , Abhishek Banerjee
    bib info
  • Lattice Signatures without Trapdoors , 738-755, Vadim Lyubashevsky
    bib info