Abstract is missing.
- Factoring Large Number with the TWIRL DeviceAdi Shamir, Eran Tromer. 1-26 [doi]
- New Partial Key Exposure Attacks on RSAJohannes Blömer, Alexander May. 27-43 [doi]
- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner BasesJean-Charles Faugère, Antoine Joux. 44-60 [doi]
- On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage ModelSalil P. Vadhan. 61-77 [doi]
- Unconditional Authenticity and Privacy from an Arbitrarily Weak SecretRenato Renner, Stefan Wolf. 78-95 [doi]
- On Cryptographic Assumptions and ChallengesMoni Naor. 96-109 [doi]
- Scalable Protocols for Authenticated Group Key ExchangeJonathan Katz, Moti Yung. 110-125 [doi]
- Practical Verifiable Encryption and Decryption of Discrete LogarithmsJan Camenisch, Victor Shoup. 126-144 [doi]
- Extending Oblivious Transfers EfficientlyYuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank. 145-161 [doi]
- Algebraic Attacks on Combiners with MemoryFrederik Armknecht, Matthias Krause. 162-175 [doi]
- Fast Algebraic Attacks on Stream Ciphers with Linear FeedbackNicolas Courtois. 176-194 [doi]
- Cryptanalysis of SAFER++Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz. 195-211 [doi]
- A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy ProblemJung Hee Cheon, Byungheup Jun. 212-225 [doi]
- The Impact of Decryption Failures on the Security of NTRU EncryptionNick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte. 226-246 [doi]
- Universally Composable Efficient Multiparty Computation from Threshold Homomorphic EncryptionIvan Damgård, Jesper Buus Nielsen. 247-264 [doi]
- Universal Composition with Joint StateRan Canetti, Tal Rabin. 265-281 [doi]
- Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and MoreDaniele Micciancio, Salil P. Vadhan. 282-298 [doi]
- Derandomization in CryptographyBoaz Barak, Shien Jin Ong, Salil P. Vadhan. 299-315 [doi]
- On Deniability in the Common Reference String and Random Oracle ModelRafael Pass. 316-337 [doi]
- Primality Proving via One Round in ECPP and One Iteration in AKSQi Cheng. 338-348 [doi]
- Torus-Based CryptographyKarl Rubin, Alice Silverberg. 349-365 [doi]
- Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way PermutationYuichi Komano, Kazuo Ohta. 366-382 [doi]
- Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography)Xavier Boyen. 383-399 [doi]
- SIGMA: The SIGn-and-MAc Approach to Authenticated Diffie-Hellman and Its Use in the IKE-ProtocolsHugo Krawczyk. 400-425 [doi]
- On Memory-Bound Functions for Fighting SpamCynthia Dwork, Andrew Goldberg, Moni Naor. 426-444 [doi]
- Lower and Upper Bounds on Obtaining History IndependenceNiv Buchbinder, Erez Petrank. 445-462 [doi]
- Private Circuits: Securing Hardware against Probing AttacksYuval Ishai, Amit Sahai, David Wagner. 463-481 [doi]
- A Tweakable Enciphering ModeShai Halevi, Phillip Rogaway. 482-499 [doi]
- A Message Authentication Code Based on Unimodular Matrix GroupsMatthew Cary, Ramarathnam Venkatesan. 500-512 [doi]
- Luby-Rackoff: 7 Rounds Are Enough for 2:::n(1-epsilon):::SecurityJacques Patarin. 513-529 [doi]
- Weak Key Authenticity and the Computational Completeness of Formal EncryptionOmer Horvitz, Virgil D. Gligor. 530-547 [doi]
- Plaintext Awareness via Key RegistrationJonathan Herzog, Moses Liskov, Silvio Micali. 548-564 [doi]
- Relaxing Chosen-Ciphertext SecurityRan Canetti, Hugo Krawczyk, Jesper Buus Nielsen. 565-582 [doi]
- Password Interception in a SSL/TLS ChannelBrice Canvel, Alain P. Hiltgen, Serge Vaudenay, Martin Vuagnoux. 583-599 [doi]
- Instant Ciphertext-Only Cryptanalysis of GSM Encrypted CommunicationElad Barkan, Eli Biham, Nathan Keller. 600-616 [doi]
- Making a Faster Cryptanalytic Time-Memory Trade-OffPhilippe Oechslin. 617-630 [doi]