11. CRYPTO 1991: Santa Barbara, California, USA

Protocol Design and Analysis

• Martín Abadi, Michael Burrows, Butler W. Lampson, Gordon D. Plotkin:
  A Calculus for Access Control in Distributed Systems. 1-23
  
• Marie-Jeanne Toussaint:
  Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract). 24-43
  
• Ray Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung:
  Systematic Design of Two-Party Authentication Protocols. 44-61
  

Combinatorics and Authentication

• Douglas R. Stinson:
  Combinatorial Characterizations of Authentication Codes. 62-73
  
• Douglas R. Stinson:
  Universal Hashing and Authentication Codes. 74-85
  
• Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier:
  On Correlation-Immune Functions. 86-100
  

Secret Sharing and Information Theory

• Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro:
  On the Size of Shares for Secret Sharing Schemes. 101-113
  
• Cynthia Dwork:
  On Verification in Secret Sharing. 114-128
  
• Torben P. Pedersen:
  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. 129-140
  
• Michael J. Fischer, Rebecca N. Wright:
  Multiparty Secret Key Exchange Using a Random Deal of Cards. 141-155
  

Cryptoanalysis

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

Complexity Theory

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

Cryptographic Schemes Based on Number Theory

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

Pseudorandomness

• Michael Luby:
  Pseudo-random Generators from One-way Functions (Abstract). 300
  
• Jacques Patarin:
  New Results on Pseudorandom Permutation Generators Based on the DES Scheme. 301-312
  

Applications and Implementations

• Colin D. Walter:
  Faster Modular Multiplication by Operand Scaling. 313-323
  
• Tatsuaki Okamoto, Kazuo Ohta:
  Universal Electronic Cash. 324-337
  
• Birgit Pfitzmann, Michael Waidner:
  How To Break and Repair A "Provably Secure" Untraceable Payment System. 338-350
  
• Charles H. Bennett, Gilles Brassard, Claude Crépeau, Marie-Hélène Skubiszewska:
  Practical Quantum Oblivious Transfer. 351-366
  
• Albert G. Broscius, Jonathan M. Smith:
  Exploiting Parallelism in Hardware Implementations of the DES. 367-376
  

Secure Computation Protocols

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

Public-Key Cryptosystems and Signatures

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