Front matter
1-11
The First Experimental Cryptanalysis of the Data Encryption Standard
Mitsuru Matsui
12-16
Linear Cryptanalysis of the Fast Data Encipherment Algorithm
Kazuo Ohta and Kazumaro Aoki
17-25
Differential-Linear Cryptanalysis
Susan K. Langford and Martin E. Hellman
26-39
Linear Cryptanalysis Using Multiple Approximations
Burton S. Kaliski and M. J. B. Robshaw
40-49
Hashing with
SL
2
Jean-Pierre Tillich and Gilles Zémor
50-55
Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
Jinhui Chao, Kazuo Tanada and Shigeo Tsujii
56-60
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders
Ingrid Biehl, Johannes Buchmann and Christoph Thiel
61-74
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
Tatsuaki Okamoto
75-82
Directed Acyclic Graphs, One-way Functions and Digital Signatures
Extended Abstract
Daniel Bleichenbacher and Ueli M. Maurer
83-94
An Identity-Based Signature Scheme with Bounded Life-Span
Olivier Delos and Jean-Jacques Quisquater
95-107
More Flexible Exponentiation with Precomputation
Chae Hoon Lim and Pil Joong Lee
108-113
A Parallel Permutation Multiplier for a PGM Crypto-chip
Tamás Horváth, Spyros S. Magliveras and Tran van Trung
114-120
Cryptographic Randomness from Air Turbulence in Disk Drives
Don Davis, Ross Ihaka and Philip Fenstermacher
121-128
Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol
Christian Gehrmann
129-139
LFSR-based Hashing and Authentication
Hugo Krawczyk
140-149
New Bound on Authentication Code with Arbitration
Kaoru Kurosawa
150-163
Multi-Secret Sharing Schemes
Extended Abstract
Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia and Ugo Vaccaro
164-173
Designing Identification Schemes with Keys of Short Size
Jacques Stern
174-187
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Ronald Cramer, Ivan Damgård and Berry Schoenmakers
188-201
Language Dependent Secure Bit Commitment
Toshiya Itoh, Yuji Ohta and Hiroki Shizuya
202-215
On the length of cryptographic hash-values used in identification schemes
Marc Girault and Jacques Stern
216-233
Incremental Cryptography: The Case of Hashing and Signing
Mihir Bellare, Oded Goldreich and Shafi Goldwasser
234-246
An Efficient Existentially Unforgeable Signature Scheme and its Applications
Cynthia Dwork and Moni Naor
247-256
Bounds for Resilient Functions and Orthogonal Arrays
Extended Abstract
Jürgen Bierbrauer, K. Gopalakrishnan and D. R. Stinson
257-270
Tracing Traitors
Benny Chor, Amos Fiat and Moni Naor
271-281
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Ueli M. Maurer
282-293
Fast Generation of Provable Primes Using Search in Arithmetic Progressions
Preda Mihailescu
294-307
Attack on the Cryptographic Scheme NIKS-TAS
Don Coppersmith
308-317
On the Risk of Opening Distributed Keys
Mike Burmester
318-331
Cryptanalysis of Cryptosystems based on Remote Chaos Replication
Th. Beth, D. E. Lazic and A. Mathias
332-340
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences
James L. Massey and Shirlei Serconek
341-358
The Security of Cipher Block Chaining
Mihir Bellare, Joe Kilian and Phillip Rogaway
359-368
A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem
Henri Gilbert and Pascal Chauvaud
369-382
Ciphertext Only Attack for One-way function of the MAP using One Ciphertext
Yukiyasu Tsunoo, Eiji Okamoto and Tomohiko Uyematsu
383-396
Pitfalls in Designing Substitution Boxes
Extended Abstract
Jennifer Seberry, Xian-Mo Zhang and Yuliang Zheng
397-410
A Randomness-Rounds Tradeoff in Private Computation
Eyal Kushilevitz and Adi Rosén
411-424
Secure Voting Using Partially Compatible Homomorphisms
Kazue Sako and Joe Kilian
425-438
Maintaining Security in the Presence of Transient Faults
Ran Canetti and Amir Herzberg
Back matter