Table of Contents:
  • On multiple linear approximations / Alex Biryukov, Christophe De Canniere, and Michael Quisquater
  • Feistel schemes and bi-linear cryptanalysis / Nicolas T. Courtois
  • Short group signatures / Dan Boneh, Xavier Boyen, and Hovav Shacham
  • Signature schemes and anonymous credentials from bilinear maps / Jan Camenisch and Anna Lysyanskaya
  • Complete classification of bilinear hard-core functions / Thomas Holenstein, Ueli Maurer, and Johan Sjodin
  • Finding collisions on a public road, or do secure hash functions need secret coins? / Chun-Yuan Hsiao and Leonid Reyzin
  • Security of random feistel schemes with 5 or more rounds / Jacques Patarin
  • Signed binary representations revisited / Katsuyuki Okeya [and others]
  • Compressed pairings / Michael Scott and Paulo S.L.M. Barreto
  • Asymptotically optimal communication for torus-based cryptography / Marten van Dijk and David Woodruff
  • How to compress rabin ciphertexts and signatures (and More) / Craig Gentry
  • On the bounded sum-of-digits discrete logarithm problem in finite fields / Qi Cheng
  • Computing the RSA secret key is deterministic polynomial time equivalent to factoring / Alexander May
  • Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks / Rosario Gennaro
  • Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model / Giovanni Di Crescenzo, Giuseppe Persiano, and Ivan Visconti
  • Zero-knowledge proofs and string commitments withstanding quantum attacks / Ivan Damgard, Serge Fehr, and Louis Salvail
  • The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols / Mihir Bellare and Adriana Palacio
  • Near-collisions of SHA-0 / Eli Biham and Rafi Chen
  • Multicollisions in iterated hash functions : application to cascaded constructions / Antoine Joux
  • Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography / Masayuki Abe and Serge Fehr
  • Round-optimal secure two-party computation / Jonathan Katz and Rafail Ostrovsky
  • Security, liberty, and electronic communications / Susan Landau
  • An improved correlation attack against irregular clocked and filtered keystream generators / Havard Molland and Tor Helleseth
  • Rewriting variables : the complexity of fast algebraic attacks on stream ciphers / Philip Hawkes and Gregory G. Rose
  • Faster correlation attack on bluetooth keystream generator E0 / Yi Lu and Serge Vaudenay
  • A new paradigm of hybrid encryption scheme / Kaoru Kurosawa and Yvo Desmedt
  • Secure identity based encryption without random oracles / Dan Boneh and Xavier Boyen
  • Non-interactive timestamping in the bounded storage model / Tal Moran, Ronen Shaltiel, and Amnon Ta-Shma
  • IPAKE: isomorphisms for password-based authenticated key exchange / Dario Catalano, David Pointcheval, and Thomas Pornin
  • Randomness extraction and key derivation using the CBC, cascade and HMAC modes / Yevgeniy Dodis [and others]
  • Efficient tree-based revocation in groups of low-state devices / Michael T. Goodrich, Jonathan Z. Sun, and Roberto Tamassia
  • Privacy-preserving datamining on vertically partitioned databases / Cynthia Dwork and Kobbi Nissim
  • Optimal perfectly secure message transmission / K. Srinathan, Arvind Narayanan, and C. Pandu Rangan
  • Pseudo-signatures, broadcast, and multi-party computation from correlated randomness / Matthias Fitzi, Stefan Wolf, and Jurg Wullschleger.