14. CRYPTO 1994: Santa Barbara, California, USA

Block Ciphers: Differential and Linear Cryptoanaysis

• Mitsuru Matsui:
  The First Experimental Cryptanalysis of the Data Encryption Standard. 1-11
  
• Kazuo Ohta, Kazumaro Aoki:
  Linear Cryptanalysis of the Fast Data Encipherment Algorithm. 12-16
  
• Susan K. Langford, Martin E. Hellman:
  Differential-Linear Cryptanalysis. 17-25
  
• Burton S. Kaliski Jr., Matthew J. B. Robshaw:
  Linear Cryptanalysis Using Multiple Approximations. 26-39
  

Schemes Based on New Problems

• Jean-Pierre Tillich, Gilles Zémor:
  Hashing with SL_2. 40-49
  
• Jinhui Chao, Kazuo Tanada, Shigeo Tsujii:
  Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks. 50-55
  
• Ingrid Biehl, Johannes Buchmann, Christoph Thiel:
  Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders. 56-60
  

Signatures I

• Tatsuaki Okamoto:
  Designated Confirmer Signatures and Public-Key Encryption are Equivalent. 61-74
  
• Daniel Bleichenbacher, Ueli M. Maurer:
  Directed Acyclic Graphs, One-way Functions and Digital Signatures. 75-82
  
• Olivier Delos, Jean-Jacques Quisquater:
  An Identity-Based Signature Scheme with Bounded Life-Span. 83-94
  

Implementation and Hardware Aspects

• Chae Hoon Lim, Pil Joong Lee:
  More Flexible Exponentiation with Precomputation. 95-107
  
• Tamás Horváth, Spyros S. Magliveras, Tran van Trung:
  A Parallel Permutation Multiplier for a PGM Crypto-chip. 108-113
  
• Don Davis, Ross Ihaka, Philip Fenstermacher:
  Cryptographic Randomness from Air Turbulence in Disk Drives. 114-120
  

Authentication and Secret Sharing

• Christian Gehrmann:
  Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol. 121-128
  
• Hugo Krawczyk:
  LFSR-based Hashing and Authentication. 129-139
  
• Kaoru Kurosawa:
  New Bound on Authentication Code with Arbitration. 140-149
  
• Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia, Ugo Vaccaro:
  Multi-Secret Sharing Schemes. 150-163
  

Zero Knowledge

• Jacques Stern:
  Designing Identification Schemes with Keys of Short Size. 164-173
  
• Ronald Cramer, Ivan Damgård, Berry Schoenmakers:
  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. 174-187
  
• Toshiya Itoh, Yuji Ohta, Hiroki Shizuya:
  Language Dependent Secure Bit Commitment. 188-201
  
• Marc Girault, Jacques Stern:
  On the Length of Cryptographic Hash-Values Used in Identification Schemes. 202-215
  

Sigantures II

• Mihir Bellare, Oded Goldreich, Shafi Goldwasser:
  Incremental Cryptography: The Case of Hashing and Signing. 216-233
  
• Cynthia Dwork, Moni Naor:
  An Efficient Existentially Unforgeable Signature Scheme and its Applications. 234-246
  

Combinatorics and its Applications

• Jürgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson:
  Bounds for Resilient Functions and Orthogonal Arrays. 247-256
  
• Benny Chor, Amos Fiat, Moni Naor:
  Tracing Traitors. 257-270
  

Number Theory

• Ueli M. Maurer:
  Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms. 271-281
  
• Preda Mihailescu:
  Fast Generation of Provable Primes Using Search in Arithmetic Progressions. 282-293
  

Cryptoanaysis and Protocol Failures

• Don Coppersmith:
  Attack on the Cryptographic Scheme NIKS-TAS. 294-307
  
• Mike Burmester:
  On the Risk of Opening Distributed Keys. 308-317
  
• Thomas Beth, Dejan E. Lazic, A. Mathias:
  Cryptanalysis of Cryptosystems Based on Remote Chaos Replication. 318-331
  

Pseudo-Random Generation

• James L. Massey, Shirlei Serconek:
  A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences. 332-340
  

Block Ciphers: Design and Cryptoanaysis

• Mihir Bellare, Joe Kilian, Phillip Rogaway:
  The Security of Cipher Block Chaining. 341-358
  
• Henri Gilbert, Pascal Chauvaud:
  A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem. 359-368
  
• Yukiyasu Tsunoo, Eiji Okamoto, Tomohiko Uyematsu:
  Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext. 369-382
  
• Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
  Pitfalls in Designing Substitution Boxes (Extended Abstract). 383-396
  

Secure Computations and Protocols

• Eyal Kushilevitz, Adi Rosén:
  A Randomnesss-Rounds Tradeoff in Private Computation. 397-410
  
• Kazue Sako, Joe Kilian:
  Secure Voting Using Partially Compatible Homomorphisms. 411-424
  
• Ran Canetti, Amir Herzberg:
  Maintaining Security in the Presence of Transient Faults. 425-438