Advances in Cryptology - CRYPTO '89

1. Signature and Authentication I

   1. Undeniable Signatures

      • David Chaum, Hans van Antwerpen

      Pages 212-216

2. Signature and Authentication II

   1. A Certified Digital Signature

      • Ralph C. Merkle

      Pages 218-238

   2. Efficient Identification and Signatures for Smart Cards

      • C. P. Schnorr

      Pages 239-252

   3. A signature with shared verification scheme

      • Marijke De Soete, Jean-Jacques Quisquater, Klaus Vedder

      Pages 253-262

   4. On-Line/Off-Line Digital Signatures

      • Shimon Even, Oded Goldreich, Silvio Micali

      Pages 263-275

3. Threshold schemes and Key management

   1. On the Classification of Ideal Secret Sharing Schemes

      • Ernest F. Brickell, Daniel M. Davenport

      Pages 278-285

   2. Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space

      • Chi-Sung Laih, Lein Harn, Jau-Yien Lee, Tzonelih Hwang

      Pages 286-298

   3. Secret Sharing Over Infinite Domains

      • Benny Chor, Eyal Kushilevitz

      Pages 299-306

   4. Threshold cryptosystems

      • Yvo Desmedt, Yair Frankel

      Pages 307-315

   5. Flexible Access Control with Master Keys

      • Gerald C. Chick, Stafford E. Tavares

      Pages 316-322

4. Key distribution and Network security

   1. Key Distribution Protocol for Digital Mobile Communication Systems

      • Makoto Tatebayashi, Natsume Matsuzaki, David B. Newman Jr.

      Pages 324-334

   2. A key exchange system based on real quadratic fields Extended abstract

      • Johannes A. Buchmann, Hugh C. Williams

      Pages 335-343

   3. On Key Distribution Systems

      • Y. Yacobi, Z. Shmuely

      Pages 344-355

   4. SDNS Architecture and End-to-end Encryption

      • Ruth Nelson, John Heimann

      Pages 356-366

5. Fast computation

   1. A Survey of Hardware Implementations of RSA

      • Ernest F. Brickell

      Pages 368-370

   2. Modular Exponentiation Using Recursive Sums of Residues

      • P. A. Findlay, B. A. Johnson

      Pages 371-386

   3. A Fast Modular-multiplication Algorithm based on a Higher Radix

      • Hikaru Morita

      Pages 387-399

   4. Addition Chain Heuristics

      • Jurjen Bos, Matthijs Coster

      Pages 400-407

   5. How easy is collision search. New results and applications to DES

      • Jean-Jacques Quisquater, Jean-Paui Delescaille

      Pages 408-413

6. Odds and ends

   1. A Design Principle for Hash Functions

      • Ivan Bjerre Damgård

      Pages 416-427

CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation.

• access control
• authentication
• cryptoanalysis
• cryptography
• cryptology
• cryptosystems
• data security
• digital signature
• encryption
• hash function
• secret sharing

• Département IRO, Université de Montréal, Montréal, Canada

  Gilles Brassard

Policies and ethics