List of Accepted Papers

1. Chosen-prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
   Marc Stevens and Arjen Lenstra and Benne de Weger
    
   
2. Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
   Krzysztof Pietrzak
    
   
3. The collision intractability of MDC-2 in the ideal-cipher model
   John P. Steinberger
    
   
4. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
   Yehuda Lindell and Benny Pinkas
    
   
5. Revisiting the Efficiency of Malicious Two-Party Computation
   David P. Woodruff
    
   
6. Efficient Two-Party Secure Computation on Committed Inputs
   Stanislaw Jarecki and Vitaly Shmatikov
    
   
7. Cryptanalysis of the Sidelnikov cryptosystem
   Lorenz Minder
    
   
8. Toward a rigorous variation of Coppersmith's algorithm on three variables
   Aurelie Bauer and Antoine Joux
    
   
9. An L(1/3 + epsilon) algorithm for the discrete logarithm problem in low degree curves
   Andreas Enge and Pierrick Gaudry
    
   
10. Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
    Chun-Yuan Hsiao and Chi-Jen Lu and Leonid Reyzin
     
    
11. Zero Knowledge and Soundness are Symmetric
    Shien Jin Ong and Salil Vadhan
     
    
12. Mesh Signatures
    Xavier Boyen
     
    
13. The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
    Thomas Ristenpart and Scott Yilek
     
    
14. How to Verify on the Road
    Jan Camenisch and Susan Hohenberger and Michael Ostergaard Pedersen
     
    
15. Cryptanalysis of SFLASH with Slightly Modified Parameters
    Vivien Dubois and Pierre-Alain Fouque and Jacques Stern
     
    
16. Differential Cryptanalysis of the Stream Ciphers Py, Py6 and Pypy
    Hongjun Wu and Bart Preneel
     
    
17. Secure Computation from Random Error Correcting Codes
    Hao Chen and Ronald Cramer and Shafi Goldwasser and Robbert de Haan and Vinod Vaikuntanathan
     
    
18. Round-Efficient Secure Computation in Point-to-Point Networks
    Jonathan Katz and Chiu-Yuen Koo
     
    
19. Atomic Secure Multi-Party Multiplication with Low Communication
    Ronald Cramer and Ivan Damgaard and Robbert de Haan
     
    
20. Universally Composable Secure Computation Using Tamper-Proof Hardware
    Jonathan Katz
     
    
21. Generic and Practical Resettable Zero-Knowledge in the Bare Public-key Model
    Moti Yung and Yunlei Zhao
     
    
22. Instance-dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
    Yi Deng and Dongdai Lin
     
    
23. General Ad Hoc Encryption from Exponent Inversion IBE
    Xavier Boyen
     
    
24. Non-Interactive Proofs for Integer Multiplication
    Ivan Damgard and Rune Thorbek
     
    
25. Ate Pairing on Hyperelliptic Curves
    Robert Granger and Florian Hess and Roger Oyono and Nicolas Theriault and Frederik Vercauteren
     
    
26. Non-Wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-bit
    Willi Geiselmann and Rainer Steinwandt
     
    
27. Ideal Multipartite Secret Sharing Schemes
    Oriol Farras and Jaume Marti-Farre and Carles Padro
     
    
28. Divisible e-cash systems can be truly anonymous
    Sebastien Canard and Aline Gouget
     
    
29. A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
    Ueli Maurer and Johan Sjodin
     
    
30. Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
    Krzysztof Pietrzak and Johan Sjodin
     
    
31. Feistel Networks made Public, and Applications
    Yevgeniy Dodis and Prashant Puniya
     
    
32. Oblivious-Transfer Amplification
    Juerg Wullschleger
     
    
33. Adaptive Oblivious Transfer from Blind Signatures
    Jan Camenisch and Gregory Neven and abhi shelat