Advances in Cryptology - CRYPTO 2006

26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings

Editors:

ISBN: 978-3-540-37432-9 (Print) 978-3-540-37433-6 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Book Chapter

    Pages 1-21

    Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs

  3. Book Chapter

    Pages 22-40

    On the Power of the Randomized Iterate

  4. Book Chapter

    Pages 41-59

    Strengthening Digital Signatures Via Randomized Hashing

  5. Book Chapter

    Pages 60-77

    Round-Optimal Composable Blind Signatures in the Common Reference String Model

  6. Book Chapter

    Pages 78-96

    On Signatures of Knowledge

  7. Book Chapter

    Pages 97-111

    Non-interactive Zaps and New Techniques for NIZK

  8. Book Chapter

    Pages 112-130

    Rankin’s Constant and Blockwise Lattice Reduction

  9. Book Chapter

    Pages 131-141

    Lattice-Based Cryptography

  10. Book Chapter

    Pages 142-159

    A Method for Making Password-Based Key Exchange Resilient to Server Compromise

  11. Book Chapter

    Pages 160-179

    Mitigating Dictionary Attacks on Password-Protected Local Storage

  12. Book Chapter

    Pages 180-197

    Rationality and Adversarial Behavior in Multi-party Computation

  13. Book Chapter

    Pages 198-213

    When Random Sampling Preserves Privacy

  14. Book Chapter

    Pages 214-231

    Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

  15. Book Chapter

    Pages 232-250

    Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets

  16. Book Chapter

    Pages 251-270

    On Forward-Secure Storage

  17. Book Chapter

    Pages 271-289

    Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One

  18. Book Chapter

    Pages 290-307

    Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

  19. Book Chapter

    Pages 308-325

    Fast Algorithms for the Free Riders Problem in Broadcast Encryption

  20. Book Chapter

    Pages 326-344

    The Number Field Sieve in the Medium Prime Case

  21. Book Chapter

    Pages 345-356

    Inverting HFE Is Quasipolynomial

previous Page of 2