Front matter
3-8
Structure in the
S
-Boxes of the DES (extended abstract)
E. F. Brickell, J. H. Moore and M. R. Purtill
9-32
Cycle Structure of the DES with Weak and Semi-Weak Keys
Judy H. Moore and Gustavus J. Simmons
35-48
Private-Key Algebraic-Coded Cryptosystems
T. R. N. Rao and Kil-Hyun Nam
49-59
Some Variations on RSA Signatures & their Security
Wiebren de Jonge and David Chaum
60-63
Breaking the Cade Cipher
N. S. James, R. Lidl and H. Niederreiter
64-83
A Modification of a Broken Public-Key Cipher
John J. Cade
84-103
A Pseudo-Random Bit Generator Based on Elliptic Logarithms
Burton S. Kaliski
104-110
Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme
Oded Goldreich
111-117
Public-key Systems Based on the Difficulty of Tampering (Is there a difference between DES and RSA?)
Yvo Desmedt and Jean-Jacques Quisquater
118-167
A Secure and Privacy-Protecting Protocol for Transmitting Personal Information Between Organizations
David Chaum and Jan-Hendrik Evertse
171-185
How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)
Oded Goldreich, Silvio Micali and Avi Wigderson
186-194
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Amos Fiat and Adi Shamir
195-199
Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How
David Chaum
200-212
Demonstrating Possession of a Discrete Logarithm Without Revealing it
David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf and René Peralta
213-222
Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols
Josh Cohen Benaloh
223-233
Zero-Knowledge Simulation of Boolean Circuits
Gilles Brassard and Claude Crepeau
234-238
All-or-Nothing Disclosure of Secrets
Gilles Brassard, Claude Crepeau and Jean-Marc Robert
239-247
A zero-knowledge Poker protocol that achieves confidentiality of the players’ strategy
or
How to achieve an electronic Poker face
Claude Crépeau
251-260
Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
Josh Cohen Benaloh
261-265
How to Share a Secret with Cheaters
Martin Tompa and Heather Woll
266-274
Smallest Possible Message Expansion in Threshold Schemes
G. R. Blakley and R. D. Dixon
277-301
VLSI implementation of public-key encryption algorithms
G. A. Orton, M. P. Roy, P. A. Scott, L. E. Peppard and S. E. Tavares
302-310
Architectures for exponentiation in GF(2n)
T. Beth, B. M. Cook and D. Gollmann
311-323
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor
Paul Barrett
327-346
A High Speed Manipulation Detection Code
Robert R. Jueneman
347-377
Electronic Funds Transfer Point of Sale in Australia
Ralph Gyoery and Jennifer Seberry
381-392
The Notion of Security for Probabilistic Cryptosystems (Extended Abstract)
Silvio Micali, Charles Rackoff and Bob Sloan
393-404
Large-Scale Randomization Techniques
Neal R. Wagner, Paul S. Putter and Marianne R. Cain
405-417
On the Linear Span of Binary Sequences Obtained from Finite Geometries
Agnes Hui Chan and Richard A. Games
418-425
Some Constructions and Bounds for Authentication Codes
D. R. Stinson
426-439
Towards a Theory of Software Protection (Extended Abstract)
Oded Goldreich
443-450
Two Observations on Probabilistic Primality Testing
Pierre Beauchemin, Gilles Brassard, Claude Crépeau and Claude Goutier
451-458
Public Key Registration
Stephen M. Matyas
459-463
Is there an ultimate use of cryptography? (Extended Abstract)
Yvo Desmedt
464-479
Smart Card a Highly Reliable and Portable Security Device
Louis C. Guillou and Michel Ugon
480-487
Thomas — A Complete Single Chip RSA Device
Gordon Rankine
Back matter