Abstract is missing.
- On Multiple Linear ApproximationsAlex Biryukov, Christophe De Cannière, Michaël Quisquater. 1-22 [doi]
- Feistel Schemes and Bi-linear CryptanalysisNicolas Courtois. 23-40 [doi]
- Short Group SignaturesDan Boneh, Xavier Boyen, Hovav Shacham. 41-55 [doi]
- Signature Schemes and Anonymous Credentials from Bilinear MapsJan Camenisch, Anna Lysyanskaya. 56-72 [doi]
- Complete Classification of Bilinear Hard-Core FunctionsThomas Holenstein, Ueli M. Maurer, Johan Sjödin. 73-91 [doi]
- Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?Chun-Yuan Hsiao, Leonid Reyzin. 92-105 [doi]
- Security of Random Feistel Schemes with 5 or More RoundsJacques Patarin. 106-122 [doi]
- Signed Binary Representations RevisitedKatsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi. 123-139 [doi]
- Compressed PairingsMichael Scott, Paulo S. L. M. Barreto. 140-156 [doi]
- Asymptotically Optimal Communication for Torus-Based CryptographyMarten van Dijk, David P. Woodruff. 157-178 [doi]
- How to Compress Rabin Ciphertexts and Signatures (and More)Craig Gentry. 179-200 [doi]
- On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite FieldsQi Cheng. 201-212 [doi]
- Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to FactoringAlexander May. 213-219 [doi]
- Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle AttacksRosario Gennaro. 220-236 [doi]
- Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key ModelGiovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti. 237-253 [doi]
- Zero-Knowledge Proofs and String Commitments Withstanding Quantum AttacksIvan Damgård, Serge Fehr, Louis Salvail. 254-272 [doi]
- The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge ProtocolsMihir Bellare, Adriana Palacio. 273-289 [doi]
- Near-Collisions of SHA-0Eli Biham, Rafi Chen. 290-305 [doi]
- Multicollisions in Iterated Hash Functions. Application to Cascaded ConstructionsAntoine Joux. 306-316 [doi]
- Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold CryptographyMasayuki Abe, Serge Fehr. 317-334 [doi]
- Round-Optimal Secure Two-Party ComputationJonathan Katz, Rafail Ostrovsky. 335-354 [doi]
- Security, Liberty, and Electronic CommunicationsSusan Landau. 355-372 [doi]
- An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream GeneratorsHåvard Molland, Tor Helleseth. 373-389 [doi]
- Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream CiphersPhilip Hawkes, Gregory G. Rose. 390-406 [doi]
- Faster Correlation Attack on Bluetooth Keystream Generator E0Yi Lu 0002, Serge Vaudenay. 407-425 [doi]
- A New Paradigm of Hybrid Encryption SchemeKaoru Kurosawa, Yvo Desmedt. 426-442 [doi]
- Secure Identity Based Encryption Without Random OraclesDan Boneh, Xavier Boyen. 443-459 [doi]
- Non-interactive Timestamping in the Bounded Storage ModelTal Moran, Ronen Shaltiel, Amnon Ta-Shma. 460-476 [doi]
- IPAKE: Isomorphisms for Password-Based Authenticated Key ExchangeDario Catalano, David Pointcheval, Thomas Pornin. 477-493 [doi]
- Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC ModesYevgeniy Dodis, Rosario Gennaro, Johan Håstad, Hugo Krawczyk, Tal Rabin. 494-510 [doi]
- Efficient Tree-Based Revocation in Groups of Low-State DevicesMichael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia. 511-527 [doi]
- Privacy-Preserving Datamining on Vertically Partitioned DatabasesCynthia Dwork, Kobbi Nissim. 528-544 [doi]
- Optimal Perfectly Secure Message TransmissionK. Srinathan, Arvind Narayanan, C. Pandu Rangan. 545-561 [doi]
- Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated RandomnessMatthias Fitzi, Stefan Wolf, Jürg Wullschleger. 562-578 [doi]