Advances in Cryptology -- CRYPTO 2011

1. Front Matter

   PDF

2. Randomness and Its Use

   1. Leftover Hash Lemma, Revisited

      • Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, François-Xavier Standaert et al.

      Pages 1-20

   2. Random Oracle Reducibility

      • Paul Baecher, Marc Fischlin

      Pages 21-38

   3. Time-Lock Puzzles in the Random Oracle Model

      • Mohammad Mahmoody, Tal Moran, Salil Vadhan

      Pages 39-50

   4. Physically Uncloneable Functions in the Universal Composition Framework

      • Christina Brzuska, Marc Fischlin, Heike Schröder, Stefan Katzenbeisser

      Pages 51-70

3. Computer-Assisted Cryptographic Proofs

   1. Computer-Aided Security Proofs for the Working Cryptographer

      • Gilles Barthe, Benjamin Grégoire, Sylvain Heraud, Santiago Zanella Béguelin

      Pages 71-90

4. Outsourcing and Delegating Computation

   1. Optimal Verification of Operations on Dynamic Sets

      • Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos

      Pages 91-110

   2. Verifiable Delegation of Computation over Large Datasets

      • Siavosh Benabbas, Rosario Gennaro, Yevgeniy Vahlis

      Pages 111-131

   3. Secure Computation on the Web: Computing without Simultaneous Interaction

      • Shai Halevi, Yehuda Lindell, Benny Pinkas

      Pages 132-150

   4. Memory Delegation

      • Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz

      Pages 151-168

5. Symmetric Cryptanalysis and Constructions

   1. Automatic Search of Attacks on Round-Reduced AES and Applications

      • Charles Bouillaguet, Patrick Derbez, Pierre-Alain Fouque

      Pages 169-187

   2. How to Improve Rebound Attacks

      • María Naya-Plasencia

      Pages 188-205

   3. A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack

      • Gregor Leander, Mohamed Ahmed Abdelraheem, Hoda AlKhzaimi, Erik Zenner

      Pages 206-221

   4. The PHOTON Family of Lightweight Hash Functions

      • Jian Guo, Thomas Peyrin, Axel Poschmann

      Pages 222-239

6. Secure Computation

   1. Perfectly-Secure Multiplication for Any t < n/3

      • Gilad Asharov, Yehuda Lindell, Tal Rabin

      Pages 240-258

   2. The IPS Compiler: Optimizations, Variants and Concrete Efficiency

      • Yehuda Lindell, Eli Oxman, Benny Pinkas

      Pages 259-276

   3. 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds

      • Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov

      Pages 277-296

7. Leakage and Side Channels

   1. Leakage-Resilient Zero Knowledge

      • Sanjam Garg, Abhishek Jain, Amit Sahai

      Pages 297-315

   2. A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework

      • Carolyn Whitnall, Elisabeth Oswald

      Pages 316-334

   3. Key-Evolution Schemes Resilient to Space-Bounded Leakage

      • Stefan Dziembowski, Tomasz Kazana, Daniel Wichs

      Pages 335-353

This book constitutes the refereed proceedings of the 31st Annual International Cryptology Conference, CRYPTO 2011, held in Santa Barbara, CA, USA in August 2011. The 42 revised full papers presented were carefully reviewed and selected from 230 submissions. The volume also contains the abstract of one invited talk. The papers are organized in topical sections on randomness and its use; computer-assisted cryptographic proofs; outsourcing and delegatin computation; symmetric cryptanalysis and constructions; secure computation: leakage and side channels; quantum cryptography; lattices and knapsacks; public-key encryption; symmetric schemes; signatures; obilvious transfer and secret sharing; and multivariate and coding-based schemes.

• cryptanalysis
• cryptographic attacks
• cryptographic protocols
• cryptography
• digital signature schemes
• encryption
• multi-party computation

• Computer Science, University of California, Davis, USA

  Phillip Rogaway

Policies and ethics