Front matter
2-5
Keying the German Navy’s Enigma
David Kahn
6-16
Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context
Extended Abstract
Yvo G. Desmedt
17-27
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
Ivan Bjerre Damgård
30-34
Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks
Russell L. Brand
35-43
The use of Encryption in Kerberos for Network Authentication
John T. Kohl
44-63
UNIX Password Security - Ten Years Later
David C. Feldmeier and Philip R. Karn
64-73
Practical Problems with a Cryptographic Protection Scheme
Jonathan M. Smith
74-79
The Smart Diskette A Universal User Token and Personal Crypto-Engine
Paul Barrett and Raymond Eisele
82-89
On the Quadratic Spans of Periodic Sequences
Agnes Hui Chan and Richard A. Games
90-99
The Shortest Feedback Shift Register That Can Generate A Given Sequence
Cees J. A. Jansen and Dick E. Boekee
100-112
Perfect Local Randomness in Pseudo-random Sequences
Ueli M. Maurer and James L. Massey
113-127
Sparse Pseudorandom Distributions
Extended Abstract
Oded Goldreich and Hugo Krawczyk
128-136
Bit Commitment Using Pseudo-Randomness
Extended Abstract
Moni Naor
138-153
How to Predict Congruential Generators
Hugo Krawczyk
154-163
A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang
Bart Preneel, Antoon Bosselaers, René Govaerts and Joos Vandewalle
164-174
On the Linear Consistency Test (LCT) in Cryptanalysis with Applications
Kencheng Zeng, C. H. Yang and T. R. N. Rao
175-185
Batch RSA
Amos Fiat
186-192
On the Implementation of Elliptic Curve Cryptosystems
Andreas Bender and Guy Castagnoli
194-211
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs
Mihir Bellare and Shafi Goldwasser
212-216
Undeniable Signatures
David Chaum and Hans van Antwerpen
218-238
A Certified Digital Signature
Ralph C. Merkle
239-252
Efficient Identification and Signatures for Smart Cards
C. P. Schnorr
253-262
A signature with shared verification scheme
Marijke De Soete, Jean-Jacques Quisquater and Klaus Vedder
263-275
On-Line/Off-Line Digital Signatures
Shimon Even, Oded Goldreich and Silvio Micali
278-285
On the Classification of Ideal Secret Sharing Schemes
Extended Abstract
Ernest F. Brickell and Daniel M. Davenport
286-298
Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space
Chi-Sung Laih, Lein Harn, Jau-Yien Lee and Tzonelih Hwang
299-306
Secret Sharing Over Infinite Domains
extended abstract
Benny Chor and Eyal Kushilevitz
307-315
Threshold cryptosystems
Yvo Desmedt and Yair Frankel
316-322
Flexible Access Control with Master Keys
Gerald C. Chick and Stafford E. Tavares
324-334
Key Distribution Protocol for Digital Mobile Communication Systems
Makoto Tatebayashi, Natsume Matsuzaki and David B. Newman
335-343
A key exchange system based on real quadratic fields Extended abstract
Johannes A. Buchmann and Hugh C. Williams
344-355
On Key Distribution Systems
Y. Yacobi and Z. Shmuely
356-366
SDNS Architecture and End-to-end Encryption
Ruth Nelson and John Heimann
368-370
A Survey of Hardware Implementations of RSA
Abstract
Ernest F. Brickell
371-386
Modular Exponentiation Using Recursive Sums of Residues
P. A. Findlay and B. A. Johnson
387-399
A Fast Modular-multiplication Algorithm based on a Higher Radix
Hikaru Morita
400-407
Addition Chain Heuristics
Jurjen Bos and Matthijs Coster
408-413
How easy is collision search. New results and applications to DES
abstract and results
Jean-Jacques Quisquater and Jean-Paui Delescaille
416-427
A Design Principle for Hash Functions
Ivan Bjerre Damgård
428-446
One Way Hash Functions and DES
Ralph C. Merkle
447-460
Properties of Cryptosystem PGM
Spyros S. Magliveras and Nasir D. Memon
461-480
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
Extended Abstract
Yuliang Zheng, Tsutomu Matsumoto and Hideki Imai
481-496
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash
Tatsuaki Okamoto and Kazuo Ohta
498-506
Efficient Identification Schemes Using Two Prover Interactive Proofs
Michael Ben-Or, Shafi Goldwasser, Joe Kilian and Avi Wigderson
507-525
On the concrete complexity of zero-knowledge proofs
Joan Boyar and René Peralta
526-544
Zero Knowledge Proofs of Knowledge in Two Rounds
U. Feige and A. Shamir
545-546
Minimum Resource Zero-Knowledge Proofs
Extended Abstract
Joe Kilian, Silvio Micali and Rafail Ostrovsky
547-557
Non-Interactive Oblivious Transfer and Applications
Mihir Bellare and Silvio Micali
560-572
Multiparty Protocols Tolerating Half Faulty Processors
Donald Beaver
573-588
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
Richard Cleve
589-590
Multiparty Computation with Faulty Majority
Donald Beaver and Shaft Goldwasser
591-602
The Spymasters Double-Agent Problem
Multiparty Computation Secure Unconditionally from Minorities and Cryptographically from Majorities
David Chaum
604-605
On the Structure of Secret Key Exchange Protocols
Mihir Bellare, Lenore Cowen and Shaft Goldwasser
606-609
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
Adi Shamir
610-611
An Efficient Software Protection Scheme
Abstract
Rafail Ostrovsky
612-615
Good S-Boxes Are Easy To Find
Carlisle Adams and Stafford Tavares
616-619
Covert Distributed Processing with Computer Viruses
Steve R. White
620-623
Progress in Data Security Standardisation
Wyn L Price
624-627
The FEAL-8 Cryptosystem and a Call for Attack
Shoji Miyaguchi
628-631
How to Explain Zero-Knowledge Protocols to Your Children
Jean-Jacques Quisquater, Myriam Quisquater, Muriel Quisquater, Michaël Quisquater and Louis Guillou, et al.
Back matter