CRYPTO 1991

SANTA BARBARA, CALIFORNIA, USA

J. Feigenbaum (Ed.): Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1001, Proceedings. Lecture Notes in Computer Science, Vol. 576, Springer, 1991, ISBN: 3-540-55188-3

Protocol Design and Analysis

  • M. Abadi, M. Burrows, B. Lampson, et al.: A Calculus for Access Control in Distributed Systems p. 1
  • Marie-Jeanne Toussaint: Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract) p. 24
  • Ray Bird, Inder Gopal, Amir Herzberg, et al.: Systematic Design of Two-Party Authentication Protocols p. 44

Combinatorics and Authentication

  • Douglas R. Stinson: Combinatorial Characterizations of Authentication Codes p. 62
  • Douglas R. Stinson: Universal Hashing and Authentication Codes p. 74
  • Paul Camion, Claude Carlet, P. Charpin, et al.: On Correlation-Immune Functions p. 86

Secret Sharing and Information Theory

  • R.M. Capocelli, A. De Santis, L. Gargano, et al.: On the Size of Shares for Secret Sharing Schemes p. 101
  • Cynthia Dwork: On Verification in Secret Sharing p. 114
  • Torben Pryds Pedersen: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing p. 129
  • Michael J. Fischer and Rebecca N. Wright: Multiparty Secret Key Exchange Using a Random Deal of Cards (Extended Abstract) p. 141

Cryptanalysis

  • Eli Biham and Adi Shamir: Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer (Extended Abstract) p. 156:
  • Anne Tardy-Corfdir and Henry Gilbert: A Known Plaintext Attack of FEAL-4 and FEAL-6 p. 172
  • Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi: A Switching Closure Test to Analyze Cryptosystems (Extended Abstract) p. 183
  • Bert den Boer and Antoon Bosselaers: An Attack on the Last Two Rounds of MD4 p. 194
  • Yeow Meng Chee, Antoine Joux, Jacques Stern: The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks p. 204

Complexity Theory

  • Dror Lapidot and Adi Shamir: A One-Round, Two-Prover, Zero-Knowledge Protocol for NP p. 213
  • Joe Kilian and Ronitt Rubinfeld: Interactive Proofs with Space Bounded Provers p. 225
  • Shang-Hua Teng: Functional Inversion and Communication Complexity p. 232
  • Steven Rudich: The Use of Interaction in Public Cryptosystems (Extended Abstract) p. 242

Cryptographic Schemes Based on Number Theory

  • Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, et al.: New Public-Key Schemes Based on Elliptic Curves over the Ring Zn p. 252
  • Tatsuaki Okamoto and Kouichi Sakurai: Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems p. 267
  • Neal Koblitz: CM-Curves with Good Cryptographic Properties p. 279
  • Shigeo Tsujii and Jinhui Chao: A New ID-Based Key Sharing System p. 288

Pseudorandomness

  • Michael Luby: Pseudo-random Generators from One-Way Functions p. 300
  • Jacques Patarin: New Results on Pseudorandom Permutation Generators Based on the DES Scheme p. 301

Applications and Implementations

  • Colin D. Walter: Faster Modular Multiplication by Operand Scaling p. 313
  • Tatsuaki Okamoto and Kazuo Ohta: Universal Electronic Cash p. 324
  • Birgit Pfitzmann and Michael Waidner: How to Break and Repair a "Provably Secure" Untraceable Payment System (Extended Abstract) p. 338
  • Charles H. Bennett, Gilles Brassard, Claude Crépeau, et al.: Practical Quantum Oblivious Transfer p. 351
  • Albert G. Broscius and Jonathan M. Smith: Exploiting Parallelism in Hardware Implementation of the DES p. 367

Secure Computation Protocols

  • Donald Beaver: Foundations of Secure Interactive Computing p. 377
  • Silvio Micali and Phillip Rogaway: Secure Computation (Abstract) p. 392
  • Kenneth R. Iversen: A Cryptographic Scheme for Computerized General Elections p. 405
  • Donald Beaver: Efficient Multiparty Protocols Using Circuit Randomization p. 420

Public-Key Crytosystems and Signatures

  • Charles Rackoff and Daniel R. Simon: Non-interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack p. 433
  • Ivan Bjerre Damgård: Towards Practical Public Key Systems Secure against Chosen Ciphertext Attacks p. 445
  • Yvo Desmedt and Yair Frankel: Shared Generation of Authenticators and Signatures (Extended Abstract) p. 457
  • David Chaum, Eugène van Heijst, Birgit Pfitzmann: Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer (Extended Abstract) p. 470

A postscript viewer, available for download here, is required to view many of these papers. For gzipped files you will also need gzip (e.g., gzip-1.2.4.msdos.exe or gzip-1.2.4.tar).

Special thanks to Michael Ley. Please visit the DBLP Computer Science Bibliography.