Front matter
1-12
Efficient Signature Schemes Based on Birational Permutations
Adi Shamir
13-21
A new identification scheme based on syndrome decoding
Jacques Stern
22-39
The Shrinking Generator
Don Coppersmith, Hugo Krawczyk and Yishay Mansour
40-48
An Integrity Check Value Algorithm for Stream Ciphers
Richard Taylor
49-60
Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics
Extended Abstract
Jennifer Seberry, Xian-Mo Zhang and Yuliang Zheng
61-72
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
Toshiya Itoh, Masafumi Hoshi and Shigeo Tsujii
73-84
Secret Sharing and Perfect Zero Knowledge
A. De Santis, G. Di Crescenzo and G. Persiano
85-99
One Message Proof Systems with Known Space Verifiers
Yonatan Aumann and Uriel Feige
100-109
Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions
Extended Abstract
Ivan B. Damgård
110-125
Fully Dynamic Secret Sharing Schemes
C. Blundo, A. Cresti, A. De Santis and U. Vaccaro
126-135
Multisecret Threshold Schemes
Wen-Ai Jackson, Keith M. Martin and Christine M. O’Keefe
136-146
Secret Sharing Made Short
Hugo Krawczyk
147-158
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Leonard M. Adleman and Jonathan DeMarrais
159-165
An implementation of the general number field sieve
Extended abstract
J. Buchmann, J. Loho and J. Zayer
166-174
On the factorization of RSA-120
T. Denny, B. Dodson, A. K. Lenstra and M. S. Manasse
175-186
Comparison of three modular reduction functions
Antoon Bosselaers, René Govaerts and Joos Vandewalle
187-199
Differential Cryptanalysis of Lucifer
Ishai Ben-Aroya and Eli Biham
200-211
Differential Attack on Message Authentication Codes
Kazuo Ohta and Mitsuru Matsui
212-223
Cryptanalysis of the CFB mode of the DES with a reduced number of rounds
Bart Preneel, Marnix Nuttin, Vincent Rijmen and Johan Buelens
224-231
Weak Keys for IDEA
Joan Daemen, René Govaerts and Joos Vandewalle
232-249
Entity Authentication and Key Distribution
Mihir Bellare and Phillip Rogaway
250-265
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
Ivan B. Damgård, Torben P. Pedersen and Birgit Pfitzmann
266-277
Joint Encryption and Message-Efficient Secure Computation
Matthew Franklin and Stuart Haber
278-291
Cryptographic Primitives Based on Hard Learning Problems
Avrim Blum, Merrick Furst, Michael Kearns and Richard J. Lipton
292-301
Extensions of Single-term Coins
Niels Ferguson
302-318
Untraceable Off-line Cash in Wallet with Observers
Extended abstract
Stefan Brands
319-330
Discreet Solitary Games
Claude Crépeau and Joe Kilian
331-342
On Families of Hash Functions via Geometric Codes and Concatenation
Jürgen Bierbrauer, Thomas Johansson, Gregory Kabatianskii and Ben Smeets
343-354
On the Construction of Perfect Authentication Codes that Permit Arbitration
Thomas Johansson
355-367
Codes for Interactive Authentication
Pete Gemmell and Moni Naor
368-378
Hash functions based on block ciphers: a synthetic approach
Bart Preneel, René Govaerts and Joos Vandewalle
379-390
Security of Iterated Hash Functions Based on Block Ciphers
Walter Hohl, Xuejia Lai, Thomas Meier and Christian Waldvogel
391-402
Improved Algorithms for the Permuted Kernel Problem
Jaques Patarin and Pascal Chauvaud
403-412
On the Distribution of Characteristics in Composite Permutations
Luke O’Connor
413-419
Remark on the Threshold RSA Signature Scheme
Chuan-Ming Li, Tzonelih Hwang and Narn-Yih Lee
420-434
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
Chae Hoon Lim and Pil Joong Lee
435-443
Attacks on the Birational Permutation Signature Schemes
Don Coppersmith, Jacques Stern and Serge Vaudenay
444-455
Interaction in Key Distribution Schemes
Extended Abstract
Amos Beimel and Benny Chor
456-479
Secret-Key Agreement without Public-Key Cryptography
Extended Abstract
Tom Leighton and Silvio Micali
480-491
Broadcast Encryption
Amos Fiat and Moni Naor
Back matter