9. CRYPTO 1989: Santa Barbara, California, USA

Opening Session

• David Kahn:
  Keying the German Navy's Enigma. 2-5
  
• Yvo Desmedt:
  Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context. 6-16
  
• Ivan Damgård:
  On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs. 17-27
  

Why is Cryptography Harder Than It Looks?

• Russell L. Brand:
  Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks. 30-34
  
• John T. Kohl:
  The use of Encryption in Kerberos for Network Authentication. 35-43
  
• David C. Feldmeier, Philip R. Karn:
  UNIX Password Security - Ten Years Later. 44-63
  
• Jonathan M. Smith:
  Practical Problems with a Cryptographic Protection Scheme. 64-73
  
• Paul Barrett, Raymund Eisele:
  The Smart Siskette - A Universal User Token and Personal Crypto-Engine. 74-79
  

Pseudo-randomness and Sequences

• Agnes Hui Chan, Richard A. Games:
  On the Quadratic Spans of Periodic Sequences. 82-89
  
• Cees J. A. Jansen, Dick E. Boekee:
  The Shortest Feedback Shift Register That Can Generate A Given Sequence. 90-99
  
• Ueli M. Maurer, James L. Massey:
  Perfect Local Randomness in Pseudo-Random Sequences. 100-112
  
• Oded Goldreich, Hugo Krawczyk:
  Sparse Pseudorandom Distributions. 113-127
  
• Moni Naor:
  Bit Commitment Using Pseudo-Randomness. 128-136
  

Cryptanalysis and Implementation

• Hugo Krawczyk:
  How to Predict Congruential Generators. 138-153
  
• Bart Preneel, Antoon Bosselaers, René Govaerts, Joos Vandewalle:
  A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang. 154-163
  
• Kencheng Zeng, Chung-Huang Yang, T. R. N. Rao:
  On the Linear Consistency Test (LCT) in Cryptanalysis with Applications. 164-174
  
• Amos Fiat:
  Batch RSA. 175-185
  
• Andreas Bender, Guy Castagnoli:
  On the Implementation of Elliptic Curve Cryptosystems. 186-192
  

Signature and Authentication I

• Mihir Bellare, Shafi Goldwasser:
  New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs. 194-211
  
• David Chaum, Hans Van Antwerpen:
  Undeniable Signatures. 212-216
  

Signature and Authentication II

• Ralph C. Merkle:
  A Certified Digital Signature. 218-238
  
• Claus-Peter Schnorr:
  Efficient Identification and Signatures for Smart Cards. 239-252
  
• Marijke De Soete, Jean-Jacques Quisquater, Klaus Vedder:
  A Signature with Shared Verification Scheme. 253-262
  
• Shimon Even, Oded Goldreich, Silvio Micali:
  On-Line/Off-Line Digital Schemes. 263-275
  

Threshold Schemes and Key Management

• Ernest F. Brickell, Daniel M. Davenport:
  On the Classification of Idea Secret Sharing Schemes. 278-285
  
• Chi-Sung Laih, Lein Harn, Jau-Yien Lee, Tzonelih Hwang:
  Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space. 286-298
  
• Benny Chor, Eyal Kushilevitz:
  Secret Sharing Over Infinite Domains (Extended Abstract). 299-306
  
• Yvo Desmedt, Yair Frankel:
  Threshold Cryptosystems. 307-315
  
• Gerald C. Chick, Stafford E. Tavares:
  Flexible Access Control with Master Keys. 316-322
  

Key Distribution and Network Security

• Makoto Tatebayashi, Natsume Matsuzaki, David B. Newman Jr.:
  Key Distribution Protocol for Digital Mobile Communication Systems. 324-334
  
• Johannes Buchmann, Hugh C. Williams:
  A Key Exchange System Based on Real Quadratic Fields. 335-343
  
• Yacov Yacobi, Zahava Shmuely:
  On Key Distribution Systems. 344-355
  
• Ruth Nelson, John Heimann:
  SDNS Architecture and End-to-End Encryption. 356-366
  

Fast Computation

• Ernest F. Brickell:
  A Survey of Hardware Implementation of RSA (Abstract). 368-370
  
• Paul A. Findlay, Brian A. Johnson:
  Modular Exponentiation Using Recursive Sums of Residues. 371-386
  
• Hikaru Morita:
  A Fast Modular-multiplication Algorithm based on a Higher Radix. 387-399
  
• Jurjen N. Bos, Matthijs J. Coster:
  Addition Chain Heuristics. 400-407
  
• Jean-Jacques Quisquater, Jean-Paul Delescaille:
  How Easy is Collision Search. New Results and Applications to DES. 408-413
  

Odds and Ends

• Ivan Damgård:
  A Design Principle for Hash Functions. 416-427
  
• Ralph C. Merkle:
  One Way Hash Functions and DES. 428-446
  
• Spyros S. Magliveras, Nasir D. Memon:
  Properties of Cryptosystem PGM. 447-460
  
• Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai:
  On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses. 461-480
  
• Tatsuaki Okamoto, Kazuo Ohta:
  Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash. 481-496
  

Zero-Knowledge and Oblivious Transfer

• Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
  Efficient Identification Schemes Using Two Prover Interactive Proofs. 498-506
  
• Joan Boyar, René Peralta:
  On the Concrete Complexity of Zero-Knowledge Proofs. 507-525
  
• Uriel Feige, Adi Shamir:
  Zero Knowledge Proofs of Knowledge in Two Rounds. 526-544
  
• Joe Kilian, Silvio Micali, Rafail Ostrovsky:
  Minimum Resource Zero-Knowledge Proofs (Extended Abstract). 545-546
  
• Mihir Bellare, Silvio Micali:
  Non-Interactive Oblivious Transfer and Spplications. 547-557
  

Multiparty Computation

• Donald Beaver:
  Multiparty Protocols Tolerating Half Faulty Processors. 560-572
  
• Richard Cleve:
  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. 573-588
  
• Donald Beaver, Shafi Goldwasser:
  Multiparty Computation with Faulty Majority. 589-590
  
• David Chaum:
  The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities. 591-602
  

Rump Session: Impromptu Talks

• Mihir Bellare, Lenore Cowen, Shafi Goldwasser:
  On the Structure of Secret Key Exchange Protocols. 604-605
  
• Adi Shamir:
  An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract). 606-609
  
• Rafail Ostrovsky:
  An Efficient Software Protection Scheme. 610-611
  
• Carlisle M. Adams, Stafford E. Tavares:
  Good S-Boxes Are Easy To Find. 612-615
  
• Steve R. White:
  Covert Distributed Processing with Computer Viruses. 616-619
  
• Wyn L. Price:
  Progress in Data Security Standardization. 620-623
  
• Shoji Miyaguchi:
  The FEAL-8 Cryptosystem and a Call for Attack. 624-627
  
• Jean-Jacques Quisquater, Myriam Quisquater, Muriel Quisquater, Michaël Quisquater, Louis C. Guillou, Marie Annick Guillou, Gaïd Guillou, Anna Guillou, Gwenolé Guillou, Soazig Guillou, Thomas A. Berson:
  How to Explain Zero-Knowledge Protocols to Your Children. 628-631