Front matter
1-18
Factorization of a 512-Bit RSA Modulus
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen and Peter L. Montgomery, et al.
19-34
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
Pierrick Gaudry
35-52
Analysis and Optimization of the TWINKLE Factoring Device
Arjen K. Lenstra and Adi Shamir
53-69
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Daniel Bleichenbacher and Phong Q. Nguyen
70-80
A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme
François Grieu
81-90
Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1
Marc Girault and Jean-François Misarsky
91-101
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
Jean-Sébastien Coron and David Naccache
102-103
On the Security of 3GPP Networks
Michael Walker
104-121
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
Eyal Kushilevitz and Rafail Ostrovsky
122-138
Single Database Private Information Retrieval Implies Oblivious Transfer
Giovanni Di Crescenzo, Tal Malkin and Rafail Ostrovsky
139-155
Authenticated Key Exchange Secure against Dictionary Attacks
Mihir Bellare, David Pointcheval and Phillip Rogaway
156-171
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Victor Boyko, Philip MacKenzie and Sarvar Patel
172-189
Fair Encryption of RSA Keys
Guillaume Poupard and Jacques Stern
190-206
Computing Inverses over a Shared Secret Modulus
Dario Catalano, Rosario Gennaro and Shai Halevi
207-220
Practical Threshold Signatures
Victor Shoup
221-242
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
(Extended Abstract)
Stanisław Jarecki and Anna Lysyanskaya
243-258
Confirmer Signature Schemes Secure against Adaptive Adversaries
(Extended Abstract)
Jan Camenisch and Markus Michels
259-274
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Mihir Bellare, Alexandra Boldyreva and Silvio Micali
275-288
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
Victor Shoup
289-299
Security Aspects of Practical Quantum Cryptography
Gilles Brassard, Norbert Lütkenhaus, Tal Mor and Barry C. Sanders
300-315
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
Paul Dumais, Dominic Mayers and Louis Salvail
316-334
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Ronald Cramer, Ivan Damgård and Ueli Maurer
335-350
Minimal-Latency Secure Function Evaluation
Donald Beaver
351-368
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Ueli Maurer and Stefan Wolf
369-381
New Attacks on PKCS#1 v1.5 Encryption
Jean-Sébastien Coron, Marc Joye, David Naccache and Pascal Paillier
382-391
A NICE Cryptanalysis
Éliane Jaulmes and Antoine Joux
392-407
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Nicolas Courtois, Alexander Klimov, Jacques Patarin and Adi Shamir
408-416
Cryptanalysis of Patarin’s 2-Round Public Key System with S Boxes (2R)
Eli Biham
417
Colossus and the German Lorenz Cipher — Code Breaking in WW II
Anthony E Sale
418-430
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
Ivan Damgård
431-444
Efficient Proofs that a Committed Number Lies in an Interval
Fabrice Boudot
445-452
A Composition Theorem for Universal One-Way Hash Functions
Victor Shoup
453-469
Exposure-Resilient Functions and All-or-Nothing Transforms
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz and Amit Sahai
470-484
The Sum of PRPs Is a Secure PRF
Stefan Lucks
485-506
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
Palash Sarkar and Subhamoy Maitra
507-522
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions
Anne Canteaut, Claude Carlet, Pascale Charpin and Caroline Fontaine
523-538
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
Shinichi Kawamura, Masanobu Koike, Fumihiko Sano and Atsushi Shimbo
539-556
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Martin Hirt and Kazue Sako
557-572
How to Break a Practical MIX and Design a New One
Yvo Desmedt and Kaoru Kurosawa
573-588
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Anne Canteaut and Michaël Trabbia
589-606
Advanced Slide Attacks
Alex Biryukov and David Wagner
Back matter