CRYPTO 2005: LIST OF ACCEPTED PAPERS A FORMAL TREATMENT OF ONION ROUTING Jan Camenisch and Anna Lysyanskaya A PRACTICAL ATTACK ON A BRAID GROUP BASED CRYPTOGRAPHIC PROTOCOL Alexei Myasnikov, Vladimir Shpilrain, Alexander Ushakov A QUANTUM CIPHER WITH NEAR OPTIMAL KEY-RECYCLING Ivan B. Damgaard, Thomas B. Pedersen, and Louis Salvail AN EFFICIENT CDH-BASED SIGNATURE SCHEME WITH A TIGHT SECURITY REDUCTION Benoit Chevallier-Mames ANALYSIS OF RANDOM ORACLE INSTANTIATION SCENARIOS FOR OAEP AND OTHER PRACTICAL SCHEMES Alexandra Boldyreva and Marc Fischlin AUTHENTICATING PERVASIVE DEVICES WITH HUMAN PROTOCOLS Ari Juels and Stephen A. Weis BLACK-BOX SECRET SHARING FROM PRIMITIVE SETS IN NUMBER FIELDS Ronald Cramer and Serge Fehr and Martijn Stam CHARACTERIZING NON-INTERACTIVE ZERO-KNOWLEDGE IN THE PUBLIC AND SECRET PARAMETER MODELS Rafael Pass and abhi shelat COLLUSION RESISTANT BROADCAST ENCRYPTION WITH SHORT CIPHERTEXTS AND PRIVATE KEYS Dan Boneh, Craig Gentry, and Brent Waters COMMUNICATION-EFFICIENT NON-INTERACTIVE PROOFS OF KNOWLEDGE WITH ONLINE EXTRACTORS Marc Fischlin COMPOSITION DOES NOT IMPLY ADAPTIVE SECURITY Krzysztof Pietrzak CONSTANT-ROUND MULTIPARTY COMPUTATION USING A BLACK-BOX PSEUDORANDOM GENERATOR Ivan Damgard and Yuval Ishai EFFICIENT COLLISION SEARCH ATTACKS ON SHA0 Xiaoyun Wang and Hongbo Yu and Yiqun Lisa Yin ENCRYPTION WITH KEYWORD SEARCH, REVISITED: CONSISTENCY CONDITIONS, RELATIONS TO ANONYMOUS IBE, AND EXTENSIONS Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier and Haixia Shi FINDING COLLISIONS IN THE FULL SHA1 Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu GENERIC TRANSFORMATION FOR SCALABLE BROADCAST ENCRYPTION SCHEMES Jung Yeon Hwang, Dong Hoon Lee, and JongIn Lim HMQV: A HIGH-PERFORMANCE SECURE DIFFIE-HELLMAN PROTOCOL Hugo Krawczyk IMPOSSIBILITY AND FEASIBILITY RESULTS FOR ZERO KNOWLEDGE WITH PUBLIC KEYS Joel Alwen and Giuseppe Persiano and Ivan Visconti IMPROVED SECURITY BOUNDS FOR CBC-MAC Mihir Bellare, Krzysztof Pietrzak and Phil Rogaway MERKLE-DAMGARD REVISITED : HOW TO CONSTRUCT A HASH FUNCTION Jean-Sebastien Coron and Yevgeniy Dodis and Cecile Malinaud and Prashant Puniya. NEW MONOTONES AND LOWER BOUNDS IN UNCONDITIONAL TWO-PARTY COMPUTATION Stefan Wolf and Juerg Wullschleger ON CODES, MATROIDS AND SECURE MULTI-PARTY COMPUTATION FROM LINEAR SECRET SHARING SCHEMES Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jimenez Urroz, Gregor Leander, Jaume Marti-Farre, Carles Padro ON THE DISCRETE LOGARITHM PROBLEM ON ALGEBRAIC TORI R. Granger and F. Vercauteren ON THE GENERIC INSECURITY OF FULL-DOMAIN HASH Yevgeniy Dodis and Roberto Oliveira and Krzysztof Pietrzak ONE-WAY SECRET-KEY AGREEMENT AND APPLICATIONS TO CIRCUIT POLARIZATION AND IMMUNIZATION OF PUBLIC-KEY ENCRYPTION Thomas Holenstein and Renato Renner PEBBLING AND PROOFS OF WORK Cynthia Dwork, Moni Naor, and Hoeteck Wee PRIVACY-PRESERVING SET OPERATIONS Lea Kissner and Dawn Song PRIVATE KEYWORD SEARCH ON STREAMING DATA Rafail Ostrovsky, William Skeith SECURE COMMUNICATIONS OVER INSECURE CHANNELS BASED ON SHORT AUTHENTICATED STRINGS Serge Vaudenay SECURE COMPUTATION OF CONSTANT-DEPTH CIRCUITS WITH APPLICATIONS TO DATABASE SEARCH PROBLEMS Omer Barkol and Yuval Ishai SECURE COMPUTATION WITHOUT AUTHENTICATION Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin SIMPLE AND EFFICIENT SHUFFLING WITH PROVABLE CORRECTNESS AND ZK PRIVACY Kun Peng, Ed Dawson and Colin Boyd THE CONDITIONAL CORRELATION ATTACK: A PRACTICAL ATTACK ON BLUETOOTH ENCRYPTION Yi Lu, Willi Meier, Serge Vaudenay