Abstract is missing.
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different IdentitiesMarc Stevens, Arjen K. Lenstra, Benne de Weger. 1-22 [doi]
- Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don t ExistKrzysztof Pietrzak. 23-33 [doi]
- The Collision Intractability of MDC-2 in the Ideal-Cipher ModelJohn P. Steinberger. 34-51 [doi]
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious AdversariesYehuda Lindell, Benny Pinkas. 52-78 [doi]
- Revisiting the Efficiency of Malicious Two-Party ComputationDavid P. Woodruff. 79-96 [doi]
- Efficient Two-Party Secure Computation on Committed InputsStanislaw Jarecki, Vitaly Shmatikov. 97-114 [doi]
- Universally Composable Multi-party Computation Using Tamper-Proof HardwareJonathan Katz. 115-128 [doi]
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key ModelMoti Yung, Yunlei Zhao. 129-147 [doi]
- Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous ResettabilityYi Deng, Dongdai Lin. 148-168 [doi]
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from CompressibilityChun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin. 169-186 [doi]
- Zero Knowledge and Soundness Are SymmetricShien Jin Ong, Salil P. Vadhan. 187-209 [doi]
- Mesh SignaturesXavier Boyen. 210-227 [doi]
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key AttacksThomas Ristenpart, Scott Yilek. 228-245 [doi]
- Batch Verification of Short SignaturesJan Camenisch, Susan Hohenberger, Michael Østergaard Pedersen. 246-263 [doi]
- Cryptanalysis of SFLASH with Slightly Modified ParametersVivien Dubois, Pierre-Alain Fouque, Jacques Stern. 264-275 [doi]
- Differential Cryptanalysis of the Stream Ciphers Py, Py6 and PypyHongjun Wu, Bart Preneel. 276-290 [doi]
- Secure Computation from Random Error Correcting CodesHao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan. 291-310 [doi]
- Round-Efficient Secure Computation in Point-to-Point NetworksJonathan Katz, Chiu-Yuen Koo. 311-328 [doi]
- Atomic Secure Multi-party Multiplication with Low CommunicationRonald Cramer, Ivan Damgård, Robbert de Haan. 329-346 [doi]
- Cryptanalysis of the Sidelnikov CryptosystemLorenz Minder, Amin Shokrollahi. 347-360 [doi]
- Toward a Rigorous Variation of Coppersmith s Algorithm on Three VariablesAurélie Bauer, Antoine Joux. 361-378 [doi]
- An ::::L:::: (1/3 + ::::epsilon:::: ) Algorithm for the Discrete Logarithm Problem for Low Degree CurvesAndreas Enge, Pierrick Gaudry. 379-393 [doi]
- General ::::Ad Hoc:::: Encryption from Exponent Inversion IBEXavier Boyen. 394-411 [doi]
- Non-interactive Proofs for Integer MultiplicationIvan Damgård, Rune Thorbek. 412-429 [doi]
- Ate Pairing on Hyperelliptic CurvesRobert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren. 430-447 [doi]
- Ideal Multipartite Secret Sharing SchemesOriol Farràs, Jaume Martí-Farré, Carles Padró. 448-465 [doi]
- Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-BitWilli Geiselmann, Rainer Steinwandt. 466-481 [doi]
- Divisible E-Cash Systems Can Be Truly AnonymousSébastien Canard, Aline Gouget. 482-497 [doi]
- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext SecurityUeli M. Maurer, Johan Sjödin. 498-516 [doi]
- Range Extension for Weak PRFs; The Good, the Bad, and the UglyKrzysztof Pietrzak, Johan Sjödin. 517-533 [doi]
- Feistel Networks Made Public, and ApplicationsYevgeniy Dodis, Prashant Puniya. 534-554 [doi]
- Oblivious-Transfer AmplificationJürg Wullschleger. 555-572 [doi]
- Simulatable Adaptive Oblivious TransferJan Camenisch, Gregory Neven, Abhi Shelat. 573-590 [doi]