5. CRYPTO 1985: Santa Barbara, California, USA

Signatures and Authentication

• Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller:
  Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields. 3-13
  
• Don Coppersmith:
  Another Birthday Attack. 14-17
  
• Wiebren de Jonge, David Chaum:
  Attacks on Some RSA Signatures. 18-27
  
• Ernest F. Brickell, John M. DeLaurentis:
  An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi. 28-32
  
• Gustavus J. Simmons:
  A Secure Subliminal Channel (?). 33-41
  
• Yvo Desmedt:
  Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences. 42-55
  

Protocols

• Shimon Even, Oded Goldreich, Adi Shamir:
  On the Security of Ping-Pong Protocols when Implemented using the RSA. 58-72
  
• Claude Crépeau:
  A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. 73-86
  
• Richard Berger, Sampath Kannan, René Peralta:
  A Framework for the Study of Cryptographic Protocols. 87-103
  
• Don Coppersmith:
  Cheating at Mental Poker. 104-107
  
• Whitfield Diffie:
  Security for the DoD Transmission Control Protocol. 108-127
  
• Zvi Galil, Stuart Haber, Moti Yung:
  Symmetric Public-Key Encryption. 128-137
  

Copy Protection

• James R. Gosler:
  Software Protection: Myth or Reality? 140-157
  
• Amir Herzberg, Shlomit S. Pinter:
  Public Protection of Software. 158-179
  
• G. R. Blakley, Catherine Meadows, George B. Purdy:
  Fingerprinting Long Forgiving Messages. 180-189
  

Single Key Cryptology

• David Chaum, Jan-Hendrik Evertse:
  Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers. 192-211
  
• Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman:
  Is DES a Pure Cipher? (Results of More Cycling Experiments on DES). 212-226
  
• T. E. Moore, Stafford E. Tavares:
  A Layered Approach to the Design of Private Key Cryptosystems. 227-245
  
• Eiji Okamoto, K. Nakamura:
  Lifetimes of Keys in Cryptographic Key Management Systems. 246-259
  
• Rainer A. Rueppel:
  Correlation Immunity and the Summation Generator. 260-272
  
• Thomas Siegenthaler:
  Design of Combiners to Prevent Divide and Conquer Attacks. 273-279
  
• Adi Shamir:
  On the Security of DES. 280-281
  
• G. R. Blakley:
  Information Theory Without the Finiteness Assumption, II: Unfolding the DES. 282-337
  

Two Key Cryptology

• Harriet J. Fell, Whitfield Diffie:
  Analysis of a Public Key Approach Based on Polynomial Substitution. 340-349
  
• Martin Kochanski:
  Developing an RSA Chip. 350-357
  
• Hugh C. Williams:
  An M³ Public-Key Encryption Scheme. 358-368
  
• Vijay Varadharajan:
  Trapdoor Rings and Their Use in Cryptography. 369-395
  
• Taher El Gamal:
  On Computing Logarithms Over Finite Fields. 396-402
  
• Johan Håstad:
  On Using RSA with Low Exponent in a Public Key Network. 403-408
  
• N. M. Stephens:
  Lenstra's Factorization Method Based on Elliptic Curves. 409-416
  
• Victor S. Miller:
  Use of Elliptic Curves in Cryptography. 417-426
  

Randomness and Other Problems

• Stephen Wolfram:
  Cryptography with Cellular Automata. 429-432
  
• John H. Reif, J. D. Tygar:
  Efficient Parallel Pseudo-Random Number Generation. 433-446
  
• Michael Luby, Charles Rackoff:
  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). 447
  
• Benny Chor, Oded Goldreich, Shafi Goldwasser:
  The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. 448-457
  
• Philippe Godlewski, Gérard D. Cohen:
  Some Cryptographic Aspects of Womcodes. 458-467
  
• Charles H. Bennett, Gilles Brassard, Jean-Marc Robert:
  How to Reduce Your Enemy's Information (Extended Abstract). 468-476
  
• Joan Feigenbaum:
  Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him? 477-488
  
• Johan van Tilburg, Dick E. Boekee:
  Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis. 489-513
  

Impromptu Talks

• Yvo Desmedt, Andrew M. Odlyzko:
  A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. 516-522
  
• A. F. Webster, Stafford E. Tavares:
  On the Design of S-Boxes. 523-534
  
• Don Coppersmith:
  The Real Reason for Rivest's Phenomenon. 535-536
  
• Jean-Jacques Quisquater, Yvo Desmedt, Marc Davio:
  The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys). 537-542
  
• Willem H. Haemers:
  Access Control at the Netherlands Postal and Telecommunications Services. 543-544