Front matter
1-23
A Calculus for Access Control in Distributed Systems
M. Abadi, M. Burrows, B. Lampson and G. Plotkin
24-43
Deriving the Complete Knowledge of Participants in Cryptographic Protocols
Extended Abstract
Marie-Jeanne Toussaint
44-61
Systematic Design of Two-Party Authentication Protocols
Ray Bird, Inder Gopal, Amir Herzberg, Phil Janson and Shay Kutten, et al.
62-73
Combinatorial characterizations of authentication codes
D. R. Stinson
74-85
Universal hashing and authentication codes
D. R. Stinson
86-100
On Correlation-immune functions
P. Camion, C. Carlet, P. Charpin and N. Sendrier
101-113
On the Size of Shares for Secret Sharing Schemes
R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro
114-128
On Verification in Secret Sharing
Cynthia Dwork
129-140
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Torben Pryds Pedersen
141-155
Multiparty Secret Key Exchange Using a Random Deal of Cards
Extended Abstract
Michael J. Fischer and Rebecca N. Wright
156-171
Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer
Extended Abstract
Eli Biham and Adi Shamir
172-182
A Known Plaintext Attack of FEAL-4 and FEAL-6
Anne Tardy-Corfdir and Henri Gilbert
183-193
A switching closure test to analyze cryptosystems
Extended abstract
Hikaru Morita, Kazuo Ohta and Shoji Miyaguchi
194-203
An Attack on the Last Two Rounds of MD4
Bert den Boer and Antoon Bosselaers
204-212
The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks
Yeow Meng Chee, Antoine Joux and Jacques Stern
213-224
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
Dror Lapidot and Adi Shamir
225-231
Interactive Proofs with Space Bounded Provers
Joe Kilian and Ronitt Rubinfeld
232-241
Functional Inversion and Communication Complexity
Shang-Hua Teng
242-251
The Use of Interaction in Public Cryptosystems.
extended abstract
Steven Rudich
252-266
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto and Scott A. Vanstone
267-278
Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems
Tatsuaki Okamoto and Kouichi Sakurai
279-287
CM-Curves with Good Cryptographic Properties
Neal Koblitz
288-299
A New ID-Based Key Sharing System
Shigeo Tsujii and Jinhui Chao
300
Pseudo-random Generators from One-way Functions
Michael Luby
301-312
New Results on Pseudorandom Permutation Generators Based on the Des Scheme
Jacques Patarin
313-323
Faster Modular Multiplication by Operand Scaling
Colin D. Walter
324-337
Universal Electronic Cash
Tatsuaki Okamoto and Kazuo Ohta
338-350
How to Break and Repair a “Provably Secure” Untraceable Payment System
Extended Abstract
Birgit Pfitzmann and Michael Waidner
351-366
Practical Quantum Oblivious Transfer
Charles H. Bennett, Gilles Brassard, Claude Crépeau and Marie-Hélène Skubiszewska
367-376
Exploiting Parallelism in Hardware Implementation of the DES
Albert G. Broscius and Jonathan M. Smith
377-391
Foundations of Secure Interactive Computing
Donald Beaver
392-404
Secure Computation
Abstract
Silvio Micali and Phillip Rogaway
405-419
A Cryptographic Scheme for Computerized General Elections
Kenneth R. Iversen
420-432
Efficient Multiparty Protocols Using Circuit Randomization
Donald Beaver
433-444
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Charles Rackoff and Daniel R. Simon
445-456
Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks
Ivan Damgård
457-469
Shared generation of authenticators and signatures
Extended Abstract
Yvo Desmedt and Yair Frankel
470-484
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
Extended Abstract
David Chaum, Eugène van Heijst and Birgit Pfitzmann
Back matter