Book Volume 7237 2012

Advances in Cryptology – EUROCRYPT 2012

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


ISBN: 978-3-642-29010-7 (Print) 978-3-642-29011-4 (Online)

Table of contents (43 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. Chapter

      Pages 1-7

      A Tutorial on High Performance Computing Applied to Cryptanalysis

    2. Chapter

      Pages 8-8

      Another Look at Provable Security

  3. Index Calculus

    1. Chapter

      Pages 9-26

      Cover and Decomposition Index Calculus on Elliptic Curves Made Practical

    2. Chapter

      Pages 27-44

      Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields

  4. Symmetric Constructions I

    1. Chapter

      Pages 45-62

      Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations

    2. Chapter

      Pages 63-80

      Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading

  5. Secure Computation

    1. Chapter

      Pages 81-98

      Fair Computation with Rational Players

    2. Chapter

      Pages 99-116

      Concurrently Secure Computation in Constant Rounds

    3. Chapter

      Pages 117-134

      Identity-Based Encryption Resilient to Continual Auxiliary Leakage

  6. Protocols

    1. Chapter

      Pages 135-152

      Quantum Proofs of Knowledge

    2. Chapter

      Pages 153-171

      On Round-Optimal Zero Knowledge in the Bare Public-Key Model

    3. Chapter

      Pages 172-194

      Robust Coin Flipping

    4. Chapter

      Pages 195-208

      Unconditionally-Secure Robust Secret Sharing with Compact Shares

  7. Lossy Trapdoor Functions

    1. Chapter

      Pages 209-227

      All-But-Many Lossy Trapdoor Functions

    2. Chapter

      Pages 228-245

      Identity-Based (Lossy) Trapdoor Functions and Applications

    3. Chapter

      Pages 246-262

      Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More

  8. Tools

    1. Chapter

      Pages 263-280

      Efficient Zero-Knowledge Argument for Correctness of a Shuffle

    2. Chapter

      Pages 281-300

      Malleable Proof Systems and Applications

    3. Chapter

      Pages 301-317

      Group to Group Commitments Do Not Shrink

    4. Chapter

      Pages 318-335

      Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

previous Page of 3