Advertisement

Advances in Cryptology – EUROCRYPT 2012

31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings

  • David Pointcheval
  • Thomas Johansson
Conference proceedings EUROCRYPT 2012

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7237)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. A Tutorial on High Performance Computing Applied to Cryptanalysis
      Antoine Joux
      Pages 1-7
      PDF
    2. Another Look at Provable Security
      Alfred Menezes
      Pages 8-8
      PDF

  3. Index Calculus

    1. Cover and Decomposition Index Calculus on Elliptic Curves Made Practical
      Antoine Joux, Vanessa Vitse
      Pages 9-26
      PDF
    2. Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
      Jean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault
      Pages 27-44
      PDF

  4. Symmetric Constructions I

    1. 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, Elmar Tischhauser
      Pages 45-62
      PDF
    2. Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
      Peter Gaži, Stefano Tessaro
      Pages 63-80
      PDF

  5. Secure Computation

    1. Fair Computation with Rational Players
      Adam Groce, Jonathan Katz
      Pages 81-98
      PDF
    2. Concurrently Secure Computation in Constant Rounds
      Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai
      Pages 99-116
      PDF
    3. Identity-Based Encryption Resilient to Continual Auxiliary Leakage
      Tsz Hon Yuen, Sherman S. M. Chow, Ye Zhang, Siu Ming Yiu
      Pages 117-134
      PDF

  6. Protocols

    1. Quantum Proofs of Knowledge
      Dominique Unruh
      Pages 135-152
      PDF
    2. On Round-Optimal Zero Knowledge in the Bare Public-Key Model
      Alessandra Scafuro, Ivan Visconti
      Pages 153-171
      PDF
    3. Robust Coin Flipping
      Gene S. Kopp, John D. Wiltshire-Gordon
      Pages 172-194
      PDF
    4. Unconditionally-Secure Robust Secret Sharing with Compact Shares
      Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani
      Pages 195-208
      PDF

  7. Lossy Trapdoor Functions

    1. All-But-Many Lossy Trapdoor Functions
      Dennis Hofheinz
      Pages 209-227
      PDF
    2. Identity-Based (Lossy) Trapdoor Functions and Applications
      Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters
      Pages 228-245
      PDF
    3. Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
      Hoeteck Wee
      Pages 246-262
      PDF

  8. Tools

    1. Efficient Zero-Knowledge Argument for Correctness of a Shuffle
      Stephanie Bayer, Jens Groth
      Pages 263-280
      PDF
    2. Malleable Proof Systems and Applications
      Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn
      Pages 281-300
      PDF
    3. Group to Group Commitments Do Not Shrink
      Masayuki Abe, Kristiyan Haralambiev, Miyako Ohkubo
      Pages 301-317
      PDF
    4. Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
      Allison Lewko
      Pages 318-335
      PDF

  9. Symmetric Constructions II

    1. Minimalism in Cryptography: The Even-Mansour Scheme Revisited
      Orr Dunkelman, Nathan Keller, Adi Shamir
      Pages 336-354
      PDF
    2. Message Authentication, Revisited
      Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs
      Pages 355-374
      PDF
    3. Property Preserving Symmetric Encryption
      Omkant Pandey, Yannis Rouselakis
      Pages 375-391
      PDF

  10. Symmetric Cryptanalysis

    1. Narrow-Bicliques: Cryptanalysis of Full IDEA
      Dmitry Khovratovich, Gaëtan Leurent, Christian Rechberger
      Pages 392-410
      PDF
    2. Cryptanalyses on a Merkle-Damgård Based MAC — Almost Universal Forgery and Distinguishing-H Attacks
      Yu Sasaki
      Pages 411-427
      PDF
    3. Statistical Tools Flavor Side-Channel Collision Attacks
      Amir Moradi
      Pages 428-445
      PDF

  11. Fully Homomorphic Encryption

    1. Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
      Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi
      Pages 446-464
      PDF
    2. Fully Homomorphic Encryption with Polylog Overhead
      Craig Gentry, Shai Halevi, Nigel P. Smart
      Pages 465-482
      PDF
    3. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
      Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs
      Pages 483-501
      PDF

  12. Asymmetric Cryptanalysis

    1. Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
      Yuanmi Chen, Phong Q. Nguyen
      Pages 502-519
      PDF
    2. Decoding Random Binary Linear Codes in 2n/20: How 1 + 1 = 0 Improves Information Set Decoding
      Anja Becker, Antoine Joux, Alexander May, Alexander Meurer
      Pages 520-536
      PDF

  13. Efficient Reductions

    1. Optimal Security Proofs for Full Domain Hash, Revisited
      Saqib A. Kakvi, Eike Kiltz
      Pages 537-553
      PDF
    2. On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
      Yannick Seurin
      Pages 554-571
      PDF
    3. Tightly-Secure Signatures from Lossy Identification Schemes
      Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi
      Pages 572-590
      PDF

  14. Public-Key Schemes

    1. Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
      Tatsuaki Okamoto, Katsuyuki Takashima
      Pages 591-608
      PDF
    2. Scalable Group Signatures with Revocation
      Benoît Libert, Thomas Peters, Moti Yung
      Pages 609-627
      PDF
    3. Incremental Deterministic Public-Key Encryption
      Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
      Pages 628-644
      PDF

  15. Security Models

    1. Standard Security Does Not Imply Security against Selective-Opening
      Mihir Bellare, Rafael Dowsley, Brent Waters, Scott Yilek
      Pages 645-662
      PDF
    2. Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
      Susan Hohenberger, Allison Lewko, Brent Waters
      Pages 663-681
      PDF
    3. Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation
      Alexandra Boldyreva, Jean Paul Degabriele, Kenneth G. Paterson, Martijn Stam
      Pages 682-699
      PDF

  16. Lattices

    1. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
      Daniele Micciancio, Chris Peikert
      Pages 700-718
      PDF
    2. Pseudorandom Functions and Lattices
      Abhishek Banerjee, Chris Peikert, Alon Rosen
      Pages 719-737
      PDF
    3. Lattice Signatures without Trapdoors
      Vadim Lyubashevsky
      Pages 738-755
      PDF
  17. Back Matter
    PDF

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2012, held in Cambgridge, UK, in April 2012.
The 41 papers, presented together with 2 invited talks, were carefully reviewed and selected from 195 submissions. The papers are organized in topical sections on index calculus, symmetric constructions, secure computation, protocols, lossy trapdoor functions, tools, symmetric cryptanalysis, fully homomorphic encryption, asymmetric cryptanalysis, efficient reductions, public-key schemes, security models, and lattices.

Keywords

elliptic curve cryptography multiparty computation public-key encryption signature schemes zero-knowledge

Editors and affiliations

  • David Pointcheval
    • 1
  • Thomas Johansson
    • 2
  1. 1.École Normale SupérieureParisFrance
  2. 2.Department of Electrical and Information TechnologyLund UniversityLundSweden

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-29011-4
  • Copyright Information International Association for Cryptologic Research 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-29010-7
  • Online ISBN 978-3-642-29011-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site