EUROCRYPT 1988: Davos, Switzerland

Key Distribution

• Rainer A. Rueppel:
  Key Agreements Based on Function Composition. 3-10
  
• Kenji Koyama, Kazuo Ohta:
  Security of Improved Identity-Based Conference Key Distribution Systems. 11-19
  

Authentication

• Yvo Desmedt:
  Subliminal-Free Authentication and Signature (Extended Abstract). 23-33
  
• Gustavus J. Simmons, George B. Purdy:
  Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts. 35-49
  
• Ernest F. Brickell, Douglas R. Stinson:
  Authentication Codes with Multiple Arbiters (Extended Abstract). 51-55
  
• Marijke De Soete:
  Some Constructions for Authentication-Secrecy Codes. 57-75
  
• Thomas Beth:
  Efficient Zero-Knowledge Identification Scheme for Smart Cards. 77-84
  

Signatures

• Hans-Joachim Knobloch:
  A Smart Card Implementation of the Fiat-Shamir Identification Scheme. 87-95
  
• Philippe Godlewski, Paul Camion:
  Manipulations and Errors, Detection and Localization. 97-106
  
• Svein J. Knapskog:
  Privacy Protected Payments - Realization of a Protocol that Guarantees Payer Anonymity. 107-122
  
• Louis C. Guillou, Jean-Jacques Quisquater:
  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. 123-128
  
• Marc Girault, Robert Cohen, Mireille Campana:
  A Generalized Birthday Attack. 129-156
  

Protocols

• Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
  An Interactive Data Exchange Protocol Based on Discrete Exponentiation. 159-166
  
• Jørgen Brandt, Ivan Damgård, Peter Landrock:
  Anonymous and Verifiable Registration in Databases. 167-176
  
• David Chaum:
  Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA. 177-182
  
• George I. Davida, Yvo Desmedt:
  Passports and Visas Versus IDS (Extended Abstract). 183-188
  

Complexity and Number Theory

• Harald Niederreiter:
  The Probabilistic Theory of Linear Complexity. 191-209
  
• Adina di Porto, Piero Filipponi:
  A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers. 211-223
  
• Claus-Peter Schnorr:
  On the Construction of Random Number Generators and Random Function Generators. 225-232
  

Numerical Methods

• James A. Davis, Diane B. Holdridge:
  Factorization of Large Integers on a Massively Parallel Computer. 235-243
  
• Shin-ichi Kawamura, Kyoko Hirano:
  A Fast Modular Arithmetic Algorithm Using a Residue Table (Extended Abstract). 245-250
  
• Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
  Fast Exponentiation in GF(2ⁿ). 251-255
  
• Frank Hoornaert, Marc Decroos, Joos Vandewalle, René Govaerts:
  Fast RSA-Hardware: Dream or Reality? 257-264
  

Cryptanalysis

• Raouf N. Gorgui-Naguib, Satnam Singh Dlay:
  Properties of the Euler Totient Function Modulo 24 and Some of its Cryptographic Implications. 267-274
  
• Pil Joong Lee, Ernest F. Brickell:
  An Observation on the Security of McEliece's Public-Key Cryptosystem. 275-280
  
• Brigitte Vallée, Marc Girault, Philippe Toffin:
  How to Break Okamoto's Cryptosystem by Reducing Lattice Bases. 281-291
  
• Bert den Boer:
  Cryptanalysis of F.E.A.L. 293-299
  
• Willi Meier, Othmar Staffelbach:
  Fast Correltaion Attacks on Stream Ciphers (Extended Abstract). 301-314
  

Running-Key Ciphers

• Shu Tezuka:
  A New Class of Nonlinear Functions for Running-key Generators (Extended Abstract). 317-324
  
• Ben J. M. Smeets, William G. Chambers:
  Windmill Generators: A Generalization and an Observation of How Many There Are. 325-330
  
• William G. Chambers, Dieter Gollmann:
  Lock-In Effect in Cascades of Clock-Controlled Shift-Registers. 331-343
  
• Cunsheng Ding:
  Proof of Massey's Conjectured Algorithm. 345-349
  
• Dongdai Lin, Mulan Liu:
  Linear Recurring m-Arrays. 351-357
  

Cipher Theory and Threshold

• Eiji Okamoto:
  Substantial Number of Cryptographic Keys and Its Application to Encryption Designs. 361-373
  
• Andrea Sgarro:
  A Measure of Semiequivocation. 375-387
  
• Marijke De Soete, Klaus Vedder:
  Some New Classes of Geometric Threshold Schemes. 389-401
  

New Ciphers

• C. G. Günther:
  A Universal Algorithm for Homophonic Coding. 405-414
  
• He Jingmin, Lu Kaicheng:
  A New Probabilistic Encryption Scheme. 415-418
  
• Tsutomu Matsumoto, Hideki Imai:
  Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption. 419-453
  
• Colin Boyd:
  Some Applications of Multiple Key Ciphers. 455-467