CRYPTO 1992

Santa Barbara, California, USA

Ernest F. Brickell (Ed.): Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings. Lecture Notes in Computer Science, Vol. 740, Springer, 1993, ISBN 3-540-57340-2

Digital Signatures and Identification I

  • Jurjen N. Bos, David Chaum: Provably Unforgeable Signatures. 1-14
  • Eugène van Heijst, Torben P. Pedersen, Birgit Pfitzmann: New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract). Or just the abstract. 15-30
  • Tatsuaki Okamoto: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. 31-53
  • Tatsuaki Okamoto, Atsushi Fujioka, Eiichiro Fujisaki: An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn. 54-65

The Digital Signature Standard

  • Daniel M. Gordon: Designing and Detecting Trapdoors for Discrete Log Cryptosystems. 66-75
  • Miles E. Smid, Dennis K. Branstad: Response to Comments of the NIST Proposed Digital Signature Standard. 76-88

Applications and New Problems

Secret Sharing I

  • Carlo Blundo, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro: On the information rate of secret sharing schemes (full version).  (Extended Abstract). 148-167
  • Douglas R. Stinson: New General Lower Bounds on the Information Rate of Secret Sharing Schemes. 168-182
  • Amos Beimel, Benny Chor: Universally Ideal Secret Sharing Schemes (Preliminary Version). 183-195

Theory I

  • Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (similar full paper) (Extended Abstract). 196-214
  • Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Muli Safra: Low Communication 2-Prover Zero-Knowledge Proofs for NP. 215-227
  • Shafi Goldwasser, Rafail Ostrovsky: Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). 228-245
  • Kouichi Sakurai, Toshiya Itoh: On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract). 246-259

Cryptographic Functions

  • M. Sivabalan, Stafford E. Tavares, L. E. Peppard: On the Design of SP Networks From an Information Theoretic Point of View. 260-279
  • Claude Carlet: Partially-Bent Functions. 280-291

Digital Signatures and Identification II

Computational Number Theory

  • Daniel M. Gordon, Kevin S. McCurley: Massively Parallel Computation of Discrete Logarithms. 312-323
  • René Peralta: A Quadratic Sieve on the n-Dimensional Cube. 324-332
  • Willi Meier, Othmar Staffelbach: Efficient Multiplication on Certain Nonsupersingular Elliptic Curves. 333-344
  • Kenji Koyama, Yukio Tsuruoka: Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method. 345-357
  • Jørgen Brandt, Ivan Damgård: On Generation of Probable Primes By Incremental Search. 358-370

Cryptography Education

  • Michael R. Fellows, Neal Koblitz: Kid Krypto. 371-389

Theory II

Key Distribution

DES

Secret Sharing II

  • Hans Eberle: A High-Speed DES Implementation for Network Applications. 521-539
  • Bob Blakley, G. R. Blakley, Agnes H. Chan, James L. Massey: Threshold Schemes with Disenrollment. 540-548
  • Yair Frankel, Yvo Desmedt, Mike Burmester: Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract). 549-557

Rump Session

  • Lein Harn, Hung-Yu Lin: An l-Span Generalized Secret Sharing Scheme. 558-565
  • Kaisa Nyberg, Lars R. Knudsen: Provable Security Against Differential Cryptanalysis. 566-574
  • Peter C. Wayner: Content-Addressable Search Engines and DES-like Systems. 575-586
  • Serge Vaudenay: FFT-Hash-II is not yet Collision-free. 587-593

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.