EUROCRYPT 2007

Barcelona, Spain

Naor, Moni (Ed.): Advances in Cryptology - EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings. Lecture Notes in Computer Science , Vol. 4515, Springer, 2007, ISBN: 978-3-540-72539-8

Read the paper abstracts. More »

Table of Contents

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