EUROCRYPT 2007: Barcelona, Spain

• Marc Stevens, Arjen K. Lenstra, Benne de Weger:
  Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. 1-22
  Electronic Edition (link) BibTeX
• Krzysztof Pietrzak:
  Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist. 23-33
  Electronic Edition (link) BibTeX
• John P. Steinberger:
  The Collision Intractability of MDC-2 in the Ideal-Cipher Model. 34-51
  Electronic Edition (link) BibTeX
• Yehuda Lindell, Benny Pinkas:
  An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. 52-78
  Electronic Edition (link) BibTeX
• David P. Woodruff:
  Revisiting the Efficiency of Malicious Two-Party Computation. 79-96
  Electronic Edition (link) BibTeX
• Stanislaw Jarecki, Vitaly Shmatikov:
  Efficient Two-Party Secure Computation on Committed Inputs. 97-114
  Electronic Edition (link) BibTeX
• Jonathan Katz:
  Universally Composable Multi-party Computation Using Tamper-Proof Hardware. 115-128
  Electronic Edition (link) BibTeX
• Moti Yung, Yunlei Zhao:
  Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model. 129-147
  Electronic Edition (link) BibTeX
• Yi Deng, Dongdai Lin:
  Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability. 148-168
  Electronic Edition (link) BibTeX
• Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin:
  Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. 169-186
  Electronic Edition (link) BibTeX
• Shien Jin Ong, Salil P. Vadhan:
  Zero Knowledge and Soundness Are Symmetric. 187-209
  Electronic Edition (link) BibTeX
• Xavier Boyen:
  Mesh Signatures. 210-227
  Electronic Edition (link) BibTeX
• Thomas Ristenpart, Scott Yilek:
  The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks. 228-245
  Electronic Edition (link) BibTeX
• Jan Camenisch, Susan Hohenberger, Michael Østergaard Pedersen:
  Batch Verification of Short Signatures. 246-263
  Electronic Edition (link) BibTeX
• Vivien Dubois, Pierre-Alain Fouque, Jacques Stern:
  Cryptanalysis of SFLASH with Slightly Modified Parameters. 264-275
  Electronic Edition (link) BibTeX
• Hongjun Wu, Bart Preneel:
  Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy. 276-290
  Electronic Edition (link) BibTeX
• Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan:
  Secure Computation from Random Error Correcting Codes. 291-310
  Electronic Edition (link) BibTeX
• Jonathan Katz, Chiu-Yuen Koo:
  Round-Efficient Secure Computation in Point-to-Point Networks. 311-328
  Electronic Edition (link) BibTeX
• Ronald Cramer, Ivan Damgård, Robbert de Haan:
  Atomic Secure Multi-party Multiplication with Low Communication. 329-346
  Electronic Edition (link) BibTeX
• Lorenz Minder, Amin Shokrollahi:
  Cryptanalysis of the Sidelnikov Cryptosystem. 347-360
  Electronic Edition (link) BibTeX
• Aurélie Bauer, Antoine Joux:
  Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables. 361-378
  Electronic Edition (link) BibTeX
• Andreas Enge, Pierrick Gaudry:
  An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. 379-393
  Electronic Edition (link) BibTeX
• Xavier Boyen:
  General Ad Hoc Encryption from Exponent Inversion IBE. 394-411
  Electronic Edition (link) BibTeX
• Ivan Damgård, Rune Thorbek:
  Non-interactive Proofs for Integer Multiplication. 412-429
  Electronic Edition (link) BibTeX
• Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren:
  Ate Pairing on Hyperelliptic Curves. 430-447
  Electronic Edition (link) BibTeX
• Oriol Farràs, Jaume Martí-Farré, Carles Padró:
  Ideal Multipartite Secret Sharing Schemes. 448-465
  Electronic Edition (link) BibTeX
• Willi Geiselmann, Rainer Steinwandt:
  Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit. 466-481
  Electronic Edition (link) BibTeX
• Sébastien Canard, Aline Gouget:
  Divisible E-Cash Systems Can Be Truly Anonymous. 482-497
  Electronic Edition (link) BibTeX
• Ueli M. Maurer, Johan Sjödin:
  A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security. 498-516
  Electronic Edition (link) BibTeX
• Krzysztof Pietrzak, Johan Sjödin:
  Range Extension for Weak PRFs; The Good, the Bad, and the Ugly. 517-533
  Electronic Edition (link) BibTeX
• Yevgeniy Dodis, Prashant Puniya:
  Feistel Networks Made Public, and Applications. 534-554
  Electronic Edition (link) BibTeX
• Jürg Wullschleger:
  Oblivious-Transfer Amplification. 555-572
  Electronic Edition (link) BibTeX
• Jan Camenisch, Gregory Neven, Abhi Shelat:
  Simulatable Adaptive Oblivious Transfer. 573-590
  Electronic Edition (link) BibTeX