26. CRYPTO 2006: Santa Barbara, California, USA

• Elad Barkan, Eli Biham, Adi Shamir:
  Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs. 1-21
  
• Iftach Haitner, Danny Harnik, Omer Reingold:
  On the Power of the Randomized Iterate. 22-40
  
• Shai Halevi, Hugo Krawczyk:
  Strengthening Digital Signatures Via Randomized Hashing. 41-59
  
• Marc Fischlin:
  Round-Optimal Composable Blind Signatures in the Common Reference String Model. 60-77
  
• Melissa Chase, Anna Lysyanskaya:
  On Signatures of Knowledge. 78-96
  
• Jens Groth, Rafail Ostrovsky, Amit Sahai:
  Non-interactive Zaps and New Techniques for NIZK. 97-111
  
• Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Phong Q. Nguyen:
  Rankin's Constant and Blockwise Lattice Reduction. 112-130
  
• Oded Regev:
  Lattice-Based Cryptography. 131-141
  
• Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan:
  A Method for Making Password-Based Key Exchange Resilient to Server Compromise. 142-159
  
• Ran Canetti, Shai Halevi, Michael Steiner:
  Mitigating Dictionary Attacks on Password-Protected Local Storage. 160-179
  
• Anna Lysyanskaya, Nikos Triandopoulos:
  Rationality and Adversarial Behavior in Multi-party Computation. 180-197
  
• Kamalika Chaudhuri, Nina Mishra:
  When Random Sampling Preserves Privacy. 198-213
  
• Moni Naor, Gil Segev, Adam Smith:
  Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. 214-231
  
• Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith:
  Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. 232-250
  
• Stefan Dziembowski:
  On Forward-Secure Storage. 251-270
  
• Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
  Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. 271-289
  
• Xavier Boyen, Brent Waters:
  Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). 290-307
  
• Zulfikar Ramzan, David P. Woodruff:
  Fast Algorithms for the Free Riders Problem in Broadcast Encryption. 308-325
  
• Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren:
  The Number Field Sieve in the Medium Prime Case. 326-344
  
• Louis Granboulan, Antoine Joux, Jacques Stern:
  Inverting HFE Is Quasipolynomial. 345-356
  
• Jean-Charles Faugère, Ludovic Perret:
  Cryptanalysis of 2R^- Schemes. 357-372
  
• Tal Moran, Moni Naor:
  Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. 373-392
  
• David Wagner:
  Cryptographic Protocols for Electronic Voting. 393
  
• Saurabh Agarwal, Ronald Cramer, Robbert de Haan:
  Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. 394-408
  
• Ronen Gradwohl, Salil P. Vadhan, David Zuckerman:
  Random Selection with an Adversarial Majority. 409-426
  
• Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
  Oblivious Transfer and Linear Functions. 427-444
  
• Jonathan Katz, Chiu-Yuen Koo:
  On Expected Constant-Round Protocols for Byzantine Agreement. 445-462
  
• Martin Hirt, Jesper Buus Nielsen:
  Robust Multiparty Computation with Linear Communication Complexity. 463-482
  
• Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
  On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. 483-500
  
• Ivan Damgård, Yuval Ishai:
  Scalable Secure Multiparty Computation. 501-520
  
• Hao Chen, Ronald Cramer:
  Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. 521-536
  
• Bruno Blanchet, David Pointcheval:
  Automated Security Proofs with Sequences of Games. 537-554
  
• Remo Meier, Bartosz Przydatek:
  On Robust Combiners for Private Information Retrieval and Other Primitives. 555-569
  
• Dan Boneh, Xavier Boyen:
  On the Impossibility of Efficiently Combining Collision Resistant Hash Functions. 570-583
  
• Claude Carlet:
  On the Higher Order Nonlinearities of Algebraic Immune Functions. 584-601
  
• Mihir Bellare:
  New Proofs for. 602-619