Advances in Cryptology – CRYPTO 2011

31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings

Editors:

ISBN: 978-3-642-22791-2 (Print) 978-3-642-22792-9 (Online)

Table of contents (43 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Randomness and Its Use

    1. No Access

      Book Chapter

      Pages 1-20

      Leftover Hash Lemma, Revisited

    2. No Access

      Book Chapter

      Pages 21-38

      Random Oracle Reducibility

    3. No Access

      Book Chapter

      Pages 39-50

      Time-Lock Puzzles in the Random Oracle Model

    4. No Access

      Book Chapter

      Pages 51-70

      Physically Uncloneable Functions in the Universal Composition Framework

  3. Computer-Assisted Cryptographic Proofs

    1. No Access

      Book Chapter

      Pages 71-90

      Computer-Aided Security Proofs for the Working Cryptographer

  4. Outsourcing and Delegating Computation

    1. No Access

      Book Chapter

      Pages 91-110

      Optimal Verification of Operations on Dynamic Sets

    2. No Access

      Book Chapter

      Pages 111-131

      Verifiable Delegation of Computation over Large Datasets

    3. No Access

      Book Chapter

      Pages 132-150

      Secure Computation on the Web: Computing without Simultaneous Interaction

    4. No Access

      Book Chapter

      Pages 151-168

      Memory Delegation

  5. Symmetric Cryptanalysis and Constructions

    1. No Access

      Book Chapter

      Pages 169-187

      Automatic Search of Attacks on Round-Reduced AES and Applications

    2. No Access

      Book Chapter

      Pages 188-205

      How to Improve Rebound Attacks

    3. No Access

      Book Chapter

      Pages 206-221

      A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack

    4. No Access

      Book Chapter

      Pages 222-239

      The PHOTON Family of Lightweight Hash Functions

  6. Secure Computation

    1. No Access

      Book Chapter

      Pages 240-258

      Perfectly-Secure Multiplication for Any t < n/3

    2. No Access

      Book Chapter

      Pages 259-276

      The IPS Compiler: Optimizations, Variants and Concrete Efficiency

    3. No Access

      Book Chapter

      Pages 277-296

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

  7. Leakage and Side Channels

    1. No Access

      Book Chapter

      Pages 297-315

      Leakage-Resilient Zero Knowledge

    2. No Access

      Book Chapter

      Pages 316-334

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

    3. No Access

      Book Chapter

      Pages 335-353

      Key-Evolution Schemes Resilient to Space-Bounded Leakage

    4. No Access

      Book Chapter

      Pages 354-372

      Generic Side-Channel Distinguishers: Improvements and Limitations

previous Page of 3