4. CRYPTO 1984: Santa Barbara, California, USA

Public Key Cryptosystems and Signatures

• S. C. Serpell, C. B. Brookson, B. L. Clark:
  A Prototype Encryption System Using Public Key. 3-9
  
• Taher El Gamal:
  A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. 10-18
  
• Neal R. Wagner, Marianne R. Magyarik:
  A Public Key Cryptosystem Based on the Word Problem. 19-36
  
• H. Ong, Claus-Peter Schnorr, Adi Shamir:
  Efficient Signature Schemes Based on Polynomial Equations. 37-46
  
• Adi Shamir:
  Identity-Based Cryptosystems and Signature Schemes. 47-53
  
• Benny Chor, Ronald L. Rivest:
  A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. 54-65
  
• Hugh C. Williams:
  Some Public Key Crypto-Functions as Intractable as Factorization. 66-70
  

Cryptosystems and Other Hard Problems

• Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone:
  Computing Logarithms in GF(2ⁿ). 73-82
  
• Burton S. Kaliski Jr.:
  Wyner's Analog Encryption Scheme: Results of a Simulation. 83-94
  
• Su-Shing Chen:
  On Rotation Group and Encryption of Analog Signals. 95-100
  
• Albert C. Leighton, Stephen M. Matyas:
  The History of Book Ciphers. 101-113
  
• James A. Davis, Diane B. Holdridge:
  An Update on Factorization at Sandia National Laboratories (Abstract). 114
  
• R. C. Fairfield, A. Matusevich, J. Plany:
  An LSI Digital Encryption Processor (DEP). 115-143
  
• Marc Davio, Yvo Desmedt, Jo Goubert, Frank Hoornaert, Jean-Jacques Quisquater:
  Efficient Hardware and Software Implementations for the DES. 144-146
  
• Frank Hoornaert, Jo Goubert, Yvo Desmedt:
  Efficient Hardware Implementation of the DES. 147-173
  
• Norman Proctor:
  A Self-Synchronizing Cascaded Cipher System With Dynamic Control of Error-Propagation. 174-190
  

Randomness And Its Concomitants

• Umesh V. Vazirani, Vijay V. Vazirani:
  Efficient and Secure Pseudo-Random Number Generation. 193-202
  
• R. C. Fairfield, R. L. Mortenson, K. B. Coulthart:
  An LSI Random Number Generator (RNG). 203-230
  
• Suresh C. Kothari:
  Generalized Linear Threshold Scheme. 231-241
  
• G. R. Blakley, Catherine Meadows:
  Security of Ramp Schemes. 242-268
  
• Selim G. Akl, Henk Meijer:
  A Fast Pseudo Random Permutation Generator With Applications to Cryptology. 269-275
  
• Oded Goldreich, Shafi Goldwasser, Silvio Micali:
  On the Cryptographic Applications of Random Functions. 276-288
  
• Manuel Blum, Shafi Goldwasser:
  An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. 289-302
  

Analysis and Cryptoanalysis

• Benny Chor, Oded Goldreich:
  RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. 303-313
  
• G. R. Blakley:
  Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects. 314-338
  
• Alan G. Konheim:
  Cryptanalysis of ADFGVX Encipherment Systems (Extended Abstract). 339-341
  
• Ernest F. Brickell:
  Breaking Iterated Knapsacks. 342-358
  
• Yvo Desmedt, Jean-Jacques Quisquater, Marc Davio:
  Dependence of Output on Input in DES: Small Avalanche Characteristics. 359-376
  
• James A. Reeds, J. L. Manferdelli:
  DES Has No Per Round Linear Factors. 377-389
  

Protocols and Authentication

• Donald W. Davies:
  A Message Authenticator Algorithm Suitable for A Mainframe Computer. 393-400
  
• Henry Beker, Michael Walker:
  Key Management for Secure Electronic Funds Transfer in a Retail Environment. 401-410
  
• Gustavus J. Simmons:
  Authentication Theory/Coding Theory. 411-431
  
• David Chaum:
  New Secret Codes Can Prevent a Computerized Big Brother (Abstract). 432-433
  
• Tom Tedrick:
  Fair Exchange of Secrets. 434-438
  
• Moti Yung:
  Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game (Extended Abstract). 439-453
  
• Steven Fortune, Michael Merritt:
  Poker Protocols. 454-464
  

Impromptu Talks

• Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
  A "Paradoxical'"Solution to the Signature Problem (Abstract). 467
  
• A. K. Leung, Stafford E. Tavares:
  Sequence Complexity as a Test for Cryptographic Systems. 468-474
  
• Charles H. Bennett, Gilles Brassard:
  An Update on Quantum Cryptography. 475-480
  
• David Chaum:
  How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems. 481-485