Front matter
2
The Adolescence of Public-Key Cryptography
Whitfield Diffie
3-15
A Secure Public-Key Authentication Scheme
Zvi Galil, Stuart Haber and Moti Yung
16-22
How to improve signature schemes
Gilles Brassard
23-28
A Generalization of El Gamal’s Public Key Cryptosystem
W. J. Jaburek
29-37
An Identity-Based Key-Exchange Protocol
Christoph G. Günther
38-46
How to Keep Authenticity Alive in a Computer Network
Fritz Bauspieß and Hans-Joachim Knobloch
47-55
The Use of Fractions in Public-Key Cryptosystems
Hartmut Isselhorst
56-61
A Practical Protocol for Large Group Oriented Networks
Yair Frankel
63-74
Counting Functions Satisfying a Higher Order Strict Avalanche Criterion
Sheelagh Lloyd
75-79
A Key Distribution System Based On Any One-Way Function
Extended Abstract
George Davida, Yvo Desmedt and René Peralta
80-92
Non-linearity of Exponent Permutations
Josef P. Pieprzyk
93-101
Informational Divergence Bounds for Authentication Codes
Andrea Sgarro
102-109
2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms
Jean-Jacques Quisquater and Marc Girault
110-120
A Simple Technique for Diffusing Cryptoperiods
Stig F. Mjølsnes
122-133
A General Zero-Knowledge Scheme
Mike V. D. Burmester, Fred Piper, Yvo Desmedt and Michael Walker
134-149
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
Tatsuaki Okamoto and Kazuo Ohta
150-154
Verifiable Disclosure of Secrets and Applications (Abstract)
Claude Crépeau
155-172
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies
Joan Boyar, Katalin Friedl and Carsten Lund
173-180
An alternative to the Fiat-Shamir protocol
Jacques Stern
181-191
Sorting out zero-knowledge
Gilles Brassard and Claude Crepeau
192-195
Everything in NP can be argued in
perfect
zero-knowledge in a
bounded
number of rounds
Extended Abstract
Gilles Brassard, Claude Crépeau and Moti Yung
196-207
Zero-Knowledge Proofs of Computational Power
Moti Yung
208-217
More Efficient Match-Making and Satisfiability
The Five Card Trick
Bert den Boer
219-236
A Single Chip 1024 Bits RSA Processor
André Vandemeulebroecke, Etienne Vanzieleghem, Tony Denayer and Paul G. A. Jespers
237-242
Cryptel - The Practical Protection of an Existing Electronic Mail System
Hedwig Cnudde
243-248
Technical Security: The Starting Point
Jan Van Auseloos
249-266
Security in Open Distributed Processing
Charles Siuda
267-271
A European Call for Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation
J. Vandewalle, D. Chaum, W. Fumy, C. Jansen and P. Landrock, et al.
273-287
Legal Requirements Facing New Signature Technology
Mireille Antoine, Jean-François Brakeland, Marc Eloy and Yves Poullet
288-293
Online Cash Checks
David Chaum
294-301
Efficient Offline Electronic Checks
Extended Abstract
David Chaum, Bert den Boer, Eugène van Heyst, Stig Mjølsnes and Adri Steenbeek
302-319
Unconditional Sender and Recipient Untraceability in Spite of Active Attacks
Michael Waidner
320-327
Detection of Disrupters in the DC Protocol
Jurjen Bos and Bert den Boer
329-354
Random Mapping Statistics
Philippe Flajolet and Andrew M. Odlyzko
355-371
Factoring by electronic mail
Arjen K. Lenstra and Mark S. Manasse
372
Cryptanalysis of Short RSA Secret Exponents
Michael J. Wiener
373-381
How to Break the Direct RSA-Implementation of Mixes
Birgit Pfitzmann and Andreas Pfitzmann
382-394
An Information-Theoretic Treatment of Homophonic Substitution
Hakon N. Jendal, Yves J. B. Kuhn and James L. Massey
395-402
Cryptanalysis of a Modified Rotor Machine
Peer Wichmann
403-411
Cryptanalysis of Video Encryption Based on Space-Filling Curves
Michael Bertilsson, Ernest F. Brickell and Ingemar Ingemarsson
412-422
Impossibility and Optimality Results on Constructing Pseudorandom Permutations
Extended Abstract
Yuliang Zheng, Tsutomu Matsumoto and Hideki Imai
423-428
On the Security of Schnorr’s Pseudo Random Generator
Rainer A. Rueppel
429-434
How easy is collision search? Application to DES
Jean-Jacques Quisquater and Jean-Paul Delescaille
436-467
Prepositioned Shared Secret and/or Shared Control Schemes
Gustavus J. Simmons
468-475
Some Ideal Secret Sharing Schemes
Ernest F. Brickell
476-490
Cartesian Authentication Schemes
M. De Soete, K. Vedder and M. Walker
491-496
How to Say “No”
Albrecht Beutelspacher
497-501
Key Minimal Authentication Systems for Unconditional Secrecy
Philippe Godlewski and Chris Mitchell
503-522
Parallel Generation of Recurring Sequences
Christoph G. Günther
523-532
Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
Harald Niederreiter
533-543
On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can’t be Random
Thomas Beth and Zong-Duo Dai
544-548
Feedforward Functions Defined by de Bruijn Sequences
Z. D. Dai and K. C. Zeng
549-562
Nonlinearity Criteria for Cryptographic Functions
Willi Meier and Othmar Staffelbach
563-570
On the Linear Complexity of Feedback Registers
extended abstract
A. H. Chan, M. Goresky and A. Klapper
571-585
Linear Complexity Profiles and Continued Fractions
Muzhong Wang
586-595
A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences
Réjane Forré
597-616
On the Complexity and Efficiency of a New Key Exchange System
Johannes A. Buchmann, Stephan Düllmann and Hugh C. Williams
617-625
A New Multiple Key Cipher and an Improved Voting Scheme
Colin Boyd
626-635
Atkin’s Test: News from the Front
François Morain
636-647
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity
Ueli M. Maurer
649-650
Deciphering Bronze Age Scripts of Crete The Case of Linear A
Yves Duhoux
652-656
Faster Primality Testing
extended abstract
Wieb Bosma and Marc-Paul van der Hulst
657-661
Private-Key Algebraic-Code Cryptosystems with High Information Rates
Extended Abstract
Tzonelih Hwang and T. R. N. Rao
662-664
Zero-knowledge procedures for confidential access to medical records
Jean-Jacques Quisquater and André Bouckaert
665-669
Full Secure Key Exchange and Authentication with no Previously Shared Secrets
Josep Domingo i Ferrer and Llorenç Huguet i Rotger
670-679
Varying Feedback Shift Registers
Yves Roggeman
680-687
A Cryptanalysis of Stepk,m-Cascades
Dieter Gollmann and William G. Chambers
688-689
Efficient Identification and Signatures for Smart Cards
C. P. Schnorr
690
The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability
Michael Waidner and Birgit Pfitzmann
691-695
Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences
Glyn Carter
696-705
On the Design of Permutation P in des Type Cryptosystems
Lawrence Brown and Jennifer Seberry
706-708
A Fast Elliptic Curve Cryptosystem
G. B. Agnew, R. C. Mullin and S. A. Vanstone
Back matter