Front matter
1-19
The XTR Public Key System
Arjen K. Lenstra and Eric R. Verheul
20-35
A Chosen-Ciphertext Attack against NTRU
Éliane Jaulmes and Antoine Joux
36-54
Privacy Preserving Data Mining
Yehuda Lindell and Benny Pinkas
55-73
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Amos Beimel, Yuval Ishai and Tal Malkin
74-92
Parallel Reducibility for Information-Theoretically Secure Computation
Yevgeniy Dodis and Silvio Micali
93-111
Optimistic Fair Secure Computation
Extended Abstract
Christian Cachin and Jan Camenisch
112-130
A Cryptographic Solution to a Game Theoretic Problem
Yevgeniy Dodis, Shai Halevi and Tal Rabin
131-146
Differential Fault Attacks on Elliptic Curve Cryptosystems
Extended Abstract
Ingrid Biehl, Bernd Meyer and Volker Müller
147-165
Quantum Public-Key Cryptosystems
Tatsuaki Okamoto, Keisuke Tanaka and Shigenori Uchiyama
166-183
New Public-Key Cryptosystem Using Braid Groups
Ki Hyoung Ko, Sang Jin Lee, Jung Hee Cheon, Jae Woo Han and Ju-sung Kang, et al.
184-196
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
Don Coppersmith, Lars R. Knudsen and Chris J. Mitchell
197-215
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
John Black and Phillip Rogaway
216-228
L-collision Attacks against Randomized MACs
Michael Semanko
229-235
On the Exact Security of Full Domain Hash
Jean-Sébastien Coron
236-254
Timed Commitments
Extended Abstract
Dan Boneh and Moni Naor
255-270
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
Giuseppe Ateniese, Jan Camenisch, Marc Joye and Gene Tsudik
271-286
Provably Secure Partially Blind Signatures
Masayuki Abe and Tatsuaki Okamoto
287-299
Weaknesses in the SL2(
\mathbbF2n
\mathbb{F}_{2^n }
) Hashing Scheme
Rainer Steinwandt, Markus Grassl, Willi Geiselmann and Thomas Beth
300-315
Fast Correlation Attacks through Reconstruction of Linear Polynomials
Thomas Johansson and Fredrik Jönsson
316-332
Sequential Traitor Tracing
Reihaneh Safavi-Naini and Yejing Wang
333-352
Long-Lived Broadcast Encryption
Juan A. Garay, Jessica Staddon and Avishai Wool
353-358
Taming the Adversary
Martín Abadi
359-375
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
Anand Desai
376-393
On the Round Security of Symmetric-Key Cryptographic Primitives
Zulfikar Ramzan and Leonid Reyzin
394-412
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
Anand Desai
413-431
Efficient Non-malleable Commitment Schemes
Marc Fischlin and Roger Fischlin
432-450
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Ivan Damgård and Jesper Buus Nielsen
451-468
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Alon Rosen
469-481
An Improved Pseudo-random Generator Based on Discrete Log
Rosario Gennaro
482-500
Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
Nicolas Gisin and Stefan Wolf
501-514
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
Muxiang Zhang and Agnes Chan
515-532
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
Palash Sarkar and Subhamoy Maitra
533-543
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
Jürgen Bierbrauer and Holger Schellwat
Back matter