17. CRYPTO 1997: Santa Barbara, California, USA

Complexity Theory

• Mikael Goldmann, Mats Näslund:
  The Complexity of Computing Hard Core Predicates. 1-15
  
• Eiichiro Fujisaki, Tatsuaki Okamoto:
  Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. 16-30
  
• Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung:
  Keeping the SZK-Verifier Honest Unconditionally. 31-45
  

Invited Lecture

• Oded Goldreich:
  On the Foundations of Modern Cryptography. 46-74
  

Cryptographic Primitives

• Donald Beaver:
  Plug and Play Encryption. 75-89
  
• Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
  Deniable Encryption. 90-104
  

Lattice-Based Cryptography

• Oded Goldreich, Shafi Goldwasser, Shai Halevi:
  Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. 105-111
  
• Oded Goldreich, Shafi Goldwasser, Shai Halevi:
  Public-Key Cryptosystems from Lattice Reduction Problems. 112-131
  

Digital Signatures

• Rosario Gennaro, Hugo Krawczyk, Tal Rabin:
  RSA-Based Undeniable Signatures. 132-149
  
• Ari Juels, Michael Luby, Rafail Ostrovsky:
  Security of Blind Digital Signatures (Extended Abstract). 150-164
  
• Yuliang Zheng:
  Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption). 165-179
  
• Rosario Gennaro, Pankaj Rohatgi:
  How to Sign Digital Streams. 180-197
  

Cryptoanalysis of Public-Key Cryptosystems (I)

• Phong Q. Nguyen, Jacques Stern:
  Merkle-Hellman Revisited: A Cryptoanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations. 198-212
  
• Thomas A. Berson:
  Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack. 213-220
  
• Jean-François Misarsky:
  A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy. 221-234
  

Cryptoanalysis of Public-Key Cryptosystems (II)

• Daniel Bleichenbacher:
  On the Security of the KMOV Public Key Cryptosystem. 235-248
  
• Chae Hoon Lim, Pil Joong Lee:
  A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp. 249-263
  
• Adam Young, Moti Yung:
  The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. 264-276
  
• Mihir Bellare, Shafi Goldwasser, Daniele Micciancio:
  "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. 277-291
  

Information Theory

• Christian Cachin, Ueli M. Maurer:
  Unconditional Security Against Memory-Bounded Adversaries. 292-306
  
• Ueli M. Maurer, Stefan Wolf:
  Privacy Amplification Secure Against Active Adversaries. 307-321
  
• Moni Naor, Benny Pinkas:
  Visual Authentication and Identification. 322-336
  

Invited Lecture

• Gilles Brassard:
  Quantum Information Processing: The Good, the Bad and the Ugly. 337-341
  

Elliptic Curve Implementation

• Jorge Guajardo, Christof Paar:
  Efficient Algorithms for Elliptic Curve Cryptosystems. 342-356
  
• Jerome A. Solinas:
  An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. 357-371
  

Number-Theoretic Systems

• Tsuyoshi Takagi:
  Fast RSA-Type Cryptosystems Using N-Adic Expansion. 372-384
  
• Johannes Buchmann, Sachar Paulus:
  A One Way Function Based on Ideal Arithmetic in Number Fields. 385-394
  

Distributed Cryptography

• Shlomi Dolev, Rafail Ostrovsky:
  Efficient Anonymous Multicast and Reception (Extended Abstract). 395-409
  
• Jan Camenisch, Markus Stadler:
  Efficient Group Signature Schemes for Large Groups (Extended Abstract). 410-424
  
• Dan Boneh, Matthew K. Franklin:
  Efficient Generation of Shared RSA Keys (Extended Abstract). 425-439
  
• Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
  Proactive RSA. 440-454
  

Hash Functions

• Ran Canetti:
  Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. 455-469
  
• Mihir Bellare, Phillip Rogaway:
  Collision-Resistant Hashing: Towards Making UOWHFs Practical. 470-484
  
• Lars R. Knudsen, Bart Preneel:
  Fast and Secure Hashing Based on Codes. 485-498
  

Cryptoanalysis of Secret-Key Cryptosystems

• Jovan Dj. Golic, Renato Menicocci:
  Edit Distance Correlation Attack on the Alternating Step Generator. 499-512
  
• Eli Biham, Adi Shamir:
  Differential Fault Analysis of Secret Key Cryptosystems. 513-525
  
• David Wagner, Bruce Schneier, John Kelsey:
  Cryptoanalysis of the Cellular Encryption Algorithm. 526-537