Front matter
1-16
Securing threshold cryptosystems against chosen ciphertext attack
Victor Shoup and Rosario Gennaro
17-31
Auto-recoverable auto-certifiable cryptosystems
Adam Young and Moti Yung
32-46
A practical and provably secure scheme for publicly verifiable secret sharing and its applications
Eiichiro Fujisaki and Tatsuaki Okamoto
47-58
Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
Noboru Kunihiro and Kenji Koyama
59-71
Breaking RSA may not be equivalent to factoring
Extended abstract
Dan Boneh and Ramarathnam Venkatesan
72-84
Lower bounds on generic algorithms in groups
Ueli Maurer and Stefan Wolf
85-99
Improved cryptanalysis of RC5
Alex Biryukov and Eyal Kushilevitz
100-111
Cryptanalysis of the ANSI X9.52 CBCM mode
Eli Biham and Lars R. Knudsen
112-126
Differential-linear weak key classes of IDEA
Philip Hawkes
127-144
Divertible protocols and atomic proxy cryptography
Matt Blaze, Gerrit Bleumer and Martin Strauss
145-157
Optimum traitor tracing and asymmetric schemes
Kaoru Kurosawa and Yvo Desmedt
158-170
On finding small solutions of modular multivariate polynomial equations
Charanjit S. Jutla
171-183
Computing discrete logarithms with quadratic number rings
Damian Weber
184-200
Improved algorithms for isomorphisms of polynomials
Jacques Patarin, Louis Goubin and Nicolas Courtois
201-210
Visual cryptanalysis
Adi Shamir
211-220
How to improve an exponentiation black-box
Gérard Cohen, David Naccache, Antoine Lobstein and Gilles Zémor
221-235
Speeding up discrete log and factoring based schemes via precomputations
Victor Boyko, Marcus Peinado and Ramarathnam Venkatesan
236-250
Fast batch verification for modular exponentiation and digital signatures
Mihir Bellare, Juan A. Garay and Tal Rabin
251-265
A formal treatment of remotely keyed encryption
Extended abstract
Matt Blaze, Joan Feigenbaum and Moni Naor
266-280
Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
Mihir Bellare, Ted Krovetz and Phillip Rogaway
281-293
The chain & sum primitive and its applications to MACs and stream ciphers
Mariusz H. Jakubowski and Ramarathnam Venkatesan
294-307
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
Detlef Hühnlein, Michael J. Jacobson, Sachar Paulus and Tsuyoshi Takagi
308-318
A new public-key cryptosystem as secure as factoring
Tatsuaki Okamoto and Shigenori Uchiyama
319-333
Towards a better understanding of one-wayness: Facing linear permutations
Alain P. Hiltgen
334-345
Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
Daniel R. Simon
346-360
Secure communication in minimal connectivity models
Matthew Franklin and Rebecca N. Wright
361-374
On the foundations of oblivious transfer
Christian Cachin
375-390
Quorum-based secure multi-party computation
Donald Beaver and Avishai Wool
391-405
Strengthened security for blind signatures
David Pointcheval
406-421
Generic constructions for secure and efficient confirmer signature schemes
Extended abstract
Markus Michels and Markus Stadler
422-436
Security analysis of a practical “on the fly” authentication and signature generation
Guillaume Poupard and Jacques Stern
437-447
Universally verifiable mix-net with verification work independent of the number of mix-servers
Masayuki Abe
448-461
A practical mix
Markus Jakobsson
462-474
On the propagation criterion of degree l and order k
Claude Carlet
475-488
Highly nonlinear balanced Boolean functions with a good correlation-immunity
Eric Filiol and Caroline Fontaine
489-499
Heuristic design of cryptographically strong balanced Boolean functions
William Millan, Andrew Clark and Ed Dawson
500-511
Secret sharing schemes with bipartite access structure
Carles Padró and Germán Sáez
512-526
Combinatorial bounds for broadcast encryption
Michael Luby and Jessica Staddon
527-541
New results on multi-receiver authentication codes
R. Safavi-Naini and H. Wang
542-545
Specialized integer factorization
Don Coppersmith
546-560
Security of an identity-based cryptosystem and the related reductions
Tatsuaki Okamoto and Shigenori Uchiyama
561-575
Easy come — Easy go divisible cash
Agnes Chan, Yair Frankel and Yiannis Tsiounis
576-590
Secure and efficient metering
Moni Naor and Benny Pinkas
591-606
Optimistic fair exchange of digital signatures
Extended abstract
N. Asokan, Victor Shoup and Michael Waidner
Back matter