Front matter
1-14
Provably Unforgeable Signatures
Jurjen N. E. Bos and David Chaum
15-30
New Constructions of Fail-Stop Signatures and Lower Bounds
Extended Abstract
Eugène van Heijst, Torben Pryds Pedersen and Birgit Pfitzmann
31-53
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
Tatsuaki Okamoto
54-65
An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring
Z
n
Tatsuaki Okamoto, Atsushi Fujioka and Eiichiro Fujisaki
66-75
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
Daniel M. Gordon
76-88
Response to Comments on the NIST Proposed Digital Signature Standard
Miles E. Smid and Dennis K. Branstad
89-105
Wallet Databases with Observers
Extended Abstract
David Chaum and Torben Pryds Pedersen
106-112
Making Electronic Refunds Safer
Rafael Hirschfeld
113-138
Fair Public-Key Cryptosystems
Silvio Micali
139-147
Pricing via Processing or Combatting Junk Mail
Cynthia Dwork and Moni Naor
148-167
On the Information Rate of Secret Sharing Schemes
Extended Abstract
C. Blundo, A. De Santis, L. Gargano and U. Vaccaro
168-182
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
D. R. Stinson
183-195
Universally Ideal Secret Sharing Schemes
Preliminary Version
Amos Beimel and Benny Chor
196-214
Perfect Zero-Knowledge Arguments for
NP
Can Be Based on General Complexity Assumptions
Extended Abstract
Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan and Moti Yung
215-227
Low communication 2-prover zero-knowledge proofs for NP
Preliminary Version
Cynthia Dwork, Uri Feige, Joe Kilian, Moni Naor and Muli Safra
228-245
Invariant
Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent
Extended Abstract
Shafi Goldwasser and Rafail Ostrovsky
246-259
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols
Extended Abstract
Kouichi Sakurai and Toshiya Itoh
260-279
On the Design of SP Networks from an Information Theoretic Point of View
M. Sivabalan, S. E. Tavares and L. E. Peppard
280-291
Partially-bent functions
C. Carlet
292-304
Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks
Extended Abstract
Yuliang Zheng and Jennifer Seberry
305-311
On the Security of the Permuted Kernel Identification Scheme
Thierry Baritaud, Mireille Campana, Pascal Chauvaud and Henri Gilbert
312-323
Massively Parallel Computation of Discrete Logarithms
Daniel M. Gordon and Kevin S. McCurley
324-332
A Quadratic Sieve on the
n
-Dimensional Cube
René Peralta
333-344
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
Willi Meier and Othmar Staffelbach
345-357
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
Kenji Koyama and Yukio Tsuruoka
358-370
On Generation of Probable Primes by Incremental Search
Jørgen Brandt and Ivan Damgård
371-389
Kid Krypto
Michael Fellows and Neal Koblitz
390-420
On Defining Proofs of Knowledge
Mihir Bellare and Oded Goldreich
421-432
Public Randomness in Cryptography
Amir Herzberg and Michael Luby
433-441
Necessary and Sufficient Conditions for Collision-Free Hashing
Alexander Russell
442-460
Certifying Cryptographic Tools: The Case of Trapdoor Permutations
Mihir Bellare and Moti Yung
461-470
Protocols for Secret Key Agreement by Public Discussion Based on Common Information
Ueli M. Maurer
471-486
Perfectly-Secure Key Distribution for Dynamic Conferences
Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten and Ugo Vaccaro, et al.
487-496
Differential Cryptanalysis of the Full 16-round DES
Eli Biham and Adi Shamir
497-511
Iterative Characteristics of DES and s2-DES
Lars Ramkilde Knudsen
512-520
DES is not a Group
Keith W. Campbell and Michael J. Wiener
521-539
A High-speed DES Implementation for Network Applications
Hans Eberle
540-548
Threshold Schemes with Disenrollment
Bob Blakley, G. R. Blakley, A. H. Chan and J. L. Massey
549-557
Non-existence of homomorphic general sharing schemes for some key spaces
Extended Abstract
Yair Frankel, Yvo Desmedt and Mike Burmester
558-565
An
l
-Span Generalized Secret Sharing Scheme
Lein Harn and Hung-Yu Lin
566-574
Provable Security Against Differential Cryptanalysis
Kaisa Nyberg and Lars Ramkilde Knudsen
575-586
Content-Addressable Search Engines and DES-like Systems
Peter C. Wayner
587-593
FFT-Hash-II is not yet Collision-free
Serge Vaudenay