EUROCRYPT 1995: Saint-Malo, France

Cryptoanalysis

• Claus-Peter Schnorr, Horst Helmut Hörner:
  Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. 1-12
  
• Luke O'Connor:
  Convergence in Differential Distributions. 13-23
  
• Carlo Harpes, Gerhard G. Kramer, James L. Massey:
  A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma. 24-38
  

Signatures

• Lidong Chen, Torben P. Pedersen:
  On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity. 39-49
  
• Matthew K. Franklin, Michael K. Reiter:
  Verifiable Signature Sharing. 50-63
  
• Chae Hoon Lim, Pil Joong Lee:
  Server (Prover/Signer)-Aided Verification of Identity Proofs and Signatures. 64-78
  

Number Theory

• Reynald Lercier, François Morain:
  Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. 79-94
  
• Damian Weber:
  An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p. 95-105
  
• Peter L. Montgomery:
  A Block Lanczos Algorithm for Finding Dependencies Over GF(2). 106-120
  

Protocol Aspects

• Birgit Pfitzmann, Matthias Schunter, Michael Waidner:
  How to Break Another Provably Secure Payment System. 121-132
  
• Claude Crépeau, Louis Salvail:
  Quantum Oblivious Mutual Identification. 133-146
  
• Yvo Desmedt:
  Securing Traceability of Ciphertexts - Towards a Secure Software Key Escrow System (Extended Abstract). 147-157
  
• Christian Gehrmann:
  Secure Multiround Authentication Protocols. 158-167
  

Secret Sharing

• Rosario Gennaro, Silvio Micali:
  Verifiable Secret Sharing as Secure Computation. 168-182
  
• Wen-Ai Jackson, Keith M. Martin, Christine M. O'Keefe:
  Efficient Secret Sharing Without a Mutually Trusted Authority (Extended Abstract). 183-193
  
• Philippe Béguin, Antonella Cresti:
  General Short Computational Secret Sharing Schemes. 194-208
  

Electronic Cash

• Markus Stadler, Jean-Marc Piveteau, Jan Camenisch:
  Fair Blind Signatures. 209-219
  
• Markus Jakobsson:
  Ripping Coins For a Fair Exchange. 220-230
  
• Stefan Brands:
  Restrictive Blinding of Secret-Key Certificates. 231-247
  

Shift Registers and Boolean Function

• Jovan Dj. Golic:
  Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers. 248-262
  
• Andrew Klapper, Mark Goresky:
  Large Periods Nearly de Bruijn FCSR Sequences. 263-273
  
• Xian-Mo Zhang, Yuliang Zheng:
  On Nonlinear Resilient Functions (Extended Abstract). 274-288
  

Authentication Codes

• Kaoru Kurosawa, Satoshi Obana:
  Combinatorial Bounds for Authentication Codes with Arbitration. 289-300
  
• Hugo Krawczyk:
  New Hash Functions For Message Authentication. 301-310
  
• Jürgen Bierbrauer:
  A² Codes from Universal Hash Classes. 311-318
  

New Schemas

• David Pointcheval:
  A New Identification Scheme Based on the Perceptrons Problem. 319-328
  
• Kenji Koyama:
  Fast RSA-type Schemes Based on Singular Cubic Curves y²+axy=m³(mod n). 329-340
  

Complexity Aspects

• Kouichi Sakurai, Hiroki Shizuya:
  Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems. 341-355
  
• Mats Näslund:
  Universal Hash Functions & Hard Core Bits. 356-366
  
• Giovanni Di Crescenzo:
  Recycling Random Bits in Composed Perfect Zero-Knowledge. 367-381
  

Implementation Aspects

• Chih-Hung Wang, Tzonelih Hwang, Jiun-Jang Tsai:
  On the Matsumoto and Imai's Human Identification Scheme. 382-392
  
• Kazue Sako, Joe Kilian:
  Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. 393-403
  
• David Naccache, David M'Raïhi, William Wolfowicz, Adina di Porto:
  Are Crypto-Accelerators Really Inevitable? 20Bit Zero-Knowledge in Less than a Second on Simple 8-bit Microcontrollers. 404-409
  

Rump Session

• Stefano D'Amiano, Giovanni Di Crescenzo:
  Anonymous NIZK Proofs of Knowledge with Preprocessing. 413-416