25. CRYPTO 2005: Santa Barbara, California, USA

• Xiaoyun Wang, Hongbo Yu, Yiqun Lisa Yin:
  Efficient Collision Search Attacks on SHA-0. 1-16
  
• Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu:
  Finding Collisions in the Full SHA-1. 17-36
  
• Cynthia Dwork, Moni Naor, Hoeteck Wee:
  Pebbling and Proofs of Work. 37-54
  
• Krzysztof Pietrzak:
  Composition Does Not Imply Adaptive Security. 55-65
  
• Robert Granger, Frederik Vercauteren:
  On the Discrete Logarithm Problem on Algebraic Tori. 66-85
  
• Alexei G. Myasnikov, Vladimir Shpilrain, Alexander Ushakov:
  A Practical Attack on a Braid Group Based Cryptographic Protocol. 86-96
  
• Yi Lu, Willi Meier, Serge Vaudenay:
  The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption. 97-117
  
• Rafael Pass, Abhi Shelat:
  Unconditional Characterizations of Non-interactive Zero-Knowledge. 118-134
  
• Joël Alwen, Giuseppe Persiano, Ivan Visconti:
  Impossibility and Feasibility Results for Zero Knowledge with Public Keys. 135-151
  
• Marc Fischlin:
  Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. 152-168
  
• Jan Camenisch, Anna Lysyanskaya:
  A Formal Treatment of Onion Routing. 169-187
  
• Kun Peng, Colin Boyd, Ed Dawson:
  Simple and Efficient Shuffling with Provable Correctness and ZK Privacy. 188-204
  
• Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi:
  Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. 205-222
  
• Rafail Ostrovsky, William E. Skeith III:
  Private Searching on Streaming Data. 223-240
  
• Lea Kissner, Dawn Xiaodong Song:
  Privacy-Preserving Set Operations. 241-257
  
• Dan Boneh, Craig Gentry, Brent Waters:
  Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. 258-275
  
• Jung Yeon Hwang, Dong Hoon Lee, Jongin Lim:
  Generic Transformation for Scalable Broadcast Encryption Schemes. 276-292
  
• Ari Juels, Stephen A. Weis:
  Authenticating Pervasive Devices with Human Protocols. 293-308
  
• Serge Vaudenay:
  Secure Communications over Insecure Channels Based on Short Authenticated Strings. 309-326
  
• Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró:
  On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. 327-343
  
• Ronald Cramer, Serge Fehr, Martijn Stam:
  Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. 344-360
  
• Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
  Secure Computation Without Authentication. 361-377
  
• Ivan Damgård, Yuval Ishai:
  Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. 378-394
  
• Omer Barkol, Yuval Ishai:
  Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems. 395-411
  
• Alexandra Boldyreva, Marc Fischlin:
  Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes. 412-429
  
• Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya:
  Merkle-Damgård Revisited: How to Construct a Hash Function. 430-448
  
• Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrzak:
  On the Generic Insecurity of the Full Domain Hash. 449-466
  
• Stefan Wolf, Jürg Wullschleger:
  New Monotones and Lower Bounds in Unconditional Two-Party Computation. 467-477
  
• Thomas Holenstein, Renato Renner:
  One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. 478-493
  
• Ivan Damgård, Thomas Brochmann Pedersen, Louis Salvail:
  A Quantum Cipher with Near Optimal Key-Recycling. 494-510
  
• Benoît Chevallier-Mames:
  An Efficient CDH-Based Signature Scheme with a Tight Security Reduction. 511-526
  
• Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway:
  Improved Security Analyses for CBC MACs. 527-545
  
• Hugo Krawczyk:
  HMQV: A High-Performance Secure Diffie-Hellman Protocol. 546-566