6. CRYPTO 1986: Santa Barbara, California, USA

Andrew M. Odlyzko (Ed.): Advances in Cryptology - CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings. Lecture Notes in Computer Science 263 Springer 1987

Data Encryption Standard

Ernest F. Brickell, Judy H. Moore, M. R. Purtill:
Structure in the S-boxes of the DES. 3-8
Judy H. Moore, Gustavus J. Simmons:
Cycle Structures of the DES with Weak and Semi-Weak Keys. 9-32

T. R. N. Rao, Kil-Hyun Nam:
Private-Key Algebraic-Coded Cryptosystems. 35-48
Wiebren de Jonge, David Chaum:
Some Variations on RSA Signatures and Their Security. 49-59
N. S. James, Rudolf Lidl, Harald Niederreiter:
Breaking the Cade Cipher. 60-63
John J. Cade:
A Modification of a Broken Public-Key Cipher. 64-83
Burton S. Kaliski Jr.:
A Pseudo-Random Bit Generator Based on Elliptic Logarithms. 84-103
Oded Goldreich:
Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme. 104-110
Yvo Desmedt, Jean-Jacques Quisquater:
Public-Key Systems Based on the Difficulty of Tampering (Is There a Difference Between DES and RSA?). 111-117
David Chaum, Jan-Hendrik Evertse:
A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations. 118-167

Oded Goldreich, Silvio Micali, Avi Wigderson:
How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. 171-185
Amos Fiat, Adi Shamir:
How to Prove Yourself: Practical Solutions to Identification and Signature Problems. 186-194
David Chaum:
Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How. 195-199
David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta:
Demonstrating Possession of a Discrete Logarithm Without Revealing It. 200-212
Josh Cohen Benaloh:
Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols. 213-222
Gilles Brassard, Claude Crépeau:
Zero-Knowledge Simulation of Boolean Circuits. 223-233
Gilles Brassard, Claude Crépeau, Jean-Marc Robert:
All-or-Nothing Disclosure of Secrets. 234-238
Claude Crépeau:
A Zero-Knowledge Poker Protocol That Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face. 239-247

Josh Cohen Benaloh:
Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing. 251-260
Martin Tompa, Heather Woll:
How to Share a Secret with Cheaters. 261-265
G. R. Blakley, R. D. Dixon:
Smallest Possible Message Expansion in Threshold Schemes. 266-274

Glenn A. Orton, M. P. Roy, P. A. Scott, Lloyd E. Peppard, Stafford E. Tavares:
VLSI Implementation of Public-Key Encryption Algorithms. 277-301
Thomas Beth, B. M. Cook, Dieter Gollmann:
Architectures for Exponentiation in GF(2ⁿ). 302-310
Paul Barrett:
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. 311-323

Robert R. Jueneman:
A High Speed Manipulation Detection Code. 327-346
Ralph Gyoery, Jennifer Seberry:
Electronic Funds Transfer Point of Sale in Australia. 347-377

Silvio Micali, Charles Rackoff, Bob Sloan:
The Notion of Security for Probabilistic Cryptosystems. 381-392
Neal R. Wagner, Paul Putter, Marianne R. Cain:
Large-Scale Randomization Techniques. 393-404
Agnes Hui Chan, Richard A. Games:
On the Linear Span of binary Sequences Obtained from Finite Geometries. 405-417
Douglas R. Stinson:
Some Constructions and Bounds for authentication Codes. 418-425
Oded Goldreich:
Towards a Theory of Software Protection. 426-439

Pierre Beauchemin, Gilles Brassard, Claude Crépeau:
Two Observations on Probabilistic Primality Testing. 443-450
Stephen M. Matyas:
Public-Key Registration. 451-458
Yvo Desmedt:
Is There an ultimate Use of Cryptography? 459-463
Louis C. Guillou, Michel Ugon:
Smart Card, a Highly Reliable and Portable Security Device. 464-479
Gordon Rankine:
THOMAS - A Complete Single Chip RSA Device. 480-487