EUROCRYPT 1994: Perugia, Italy

Secret Sharing

• Moni Naor, Adi Shamir:
  Visual Cryptography. 1-12
  
• László Csirmaz:
  The Size of a Share Must Be Large. 13-22
  
• Marten van Dijk:
  A Linear Construction of Perfect Secret Sharing Schemes. 23-34
  
• Carlo Blundo, Antonio Giorgio Gaggia, Douglas R. Stinson:
  On the Dealer's Randomness Required in Secret Sharing Schemes. 35-46
  

Hash Functions

• Claus-Peter Schnorr, Serge Vaudenay:
  Black Box Cryptoanalysis of Hash Networks Based on Multipermutations. 47-57
  
• Antoine Joux, Louis Granboulan:
  A Practical Attack against Knapsack based Hash Functions (Extended Abstract). 58-66
  

Signatures I

• Matthew K. Franklin, Moti Yung:
  The Blinding of Weak Signatures (Extended Abstract). 67-76
  
• David Naccache, David M'Raïhi, Serge Vaudenay, Dan Raphaeli:
  Can D.S.A. be Improved? Complexity Trade-Offs with the Digital Signature Standard. 77-85
  
• David Chaum:
  Designated Confirmer Signatures. 86-91
  

Cryptosystems

• Mihir Bellare, Phillip Rogaway:
  Optimal Asymmetric Encryption. 92-111
  
• Glenn A. Orton:
  A Multiple-Iterated Trapdoor for Dense Compact Knapsacks. 112-130
  
• Florent Chabaud:
  On the Security of Some Cryptosystems Based on Error-correcting Codes. 131-139
  

Zero-Knowledge and Protocol Methodology

• Lidong Chen, Ivan Damgård, Torben P. Pedersen:
  Parallel Divertibility of Proofs of Knowledge (Extended Abstract). 140-155
  
• Stefano D'Amiano, Giovanni Di Crescenzo:
  Methodology for Digital Money based on General Cryptographic Tools. 156-170
  

Signatures II

• Lidong Chen, Torben P. Pedersen:
  New Group Signature Schemes (Extended Abstract). 171-181
  
• Kaisa Nyberg, Rainer A. Rueppel:
  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. 182-193
  
• Chuan-Ming Li, Tzonelih Hwang, Narn-Yih Lee:
  Threshold-Multisignature Schemes where Suspected Forgery Implies Traceability of Adversarial Shareholders. 194-204
  

Pseudorandom Generators

• Willi Meier, Othmar Staffelbach:
  The Self-Shrinking Generator. 205-214
  
• Mark Goresky, Andrew Klapper:
  Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract). 215-222
  
• Rainer Göttfert, Harald Niederreiter:
  General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences. 223-229
  
• Jovan Dj. Golic, Luke O'Connor:
  Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers. 230-243
  

Authehntication Codes

• Richard Taylor:
  Near Optimal Unconditionally Secure Authentication. 244-253
  
• Reihaneh Safavi-Naini, L. Tombak:
  Authentication Codes in Plaintext and Chosen-content Attacks. 254-265
  

Key Agreement and Key Distribution

• Christian Cachin, Ueli M. Maurer:
  Linking Information Reconciliation and Privacy Amplification (Extended Abstract). 266-274
  
• Mike Burmester, Yvo Desmedt:
  A Secure and Efficient Conference Key Distribution System (Extended Abstract). 275-286
  
• Carlo Blundo, Antonella Cresti:
  Space Requirements for Broadcast Encryption. 287-298
  
• Yuliang Zheng:
  How to Break and Repair Leighton and Micali's Key Agreement Protocol. 299-305
  

Protocols

• Tony Eng, Tatsuaki Okamoto:
  Single-Term Divisible Electronic Coins. 306-319
  
• Paul F. Syverson, Catherine Meadows:
  Formal Requirements for Key Distribution Protocols. 320-331
  
• Birgit Pfitzmann:
  Breaking Efficient Anonymous Channel. 332-340
  

Cryptoanalysis and Block Ciphers

• Eli Biham:
  On Matsui's Linear Cryptanalysis. 341-355
  
• Florent Chabaud, Serge Vaudenay:
  Links Between Differential and Linear Cryptoanalysis. 356-365
  
• Mitsuru Matsui:
  On Correlation Between the Order of S-boxes and the Strength of DES. 366-375
  
• Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
  Relationships Among Nonlinear Criteria (Extended Abstract). 376-388
  

Number Theory and Algorithms

• Peter de Rooij:
  Efficient Exponentiation using Procomputation and Vector Addition Chains. 389-399
  
• Frank Damm, F.-P. Heider, G. Wambach:
  MIMD-Factorisation on Hypercubes. 400-409
  

Rump Session

• Lars R. Knudsen, Xuejia Lai:
  New Attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel-DM. 410-418
  
• Lars R. Knudsen:
  New Potentially 'Weak' Keys for DES and LOKI (Extended Abstract). 419-424
  
• Markus Jakobsson:
  Blackmailing using Undeniable Signatures. 425-427
  
• Jan Camenisch, Jean-Marc Piveteau, Markus Stadler:
  Blind Signatures Based on the Discrete Logarithm Problem. 428-432
  
• Chris Charnes, Luke O'Connor, Josef Pieprzyk, Reihaneh Safavi-Naini, Yuliang Zheng:
  Comments on Soviet Encryption Algorithm. 433-438
  
• Kaisa Nyberg:
  Linear Approximation of Block Ciphers. 439-444
  
• Adi Shamir:
  Memory Efficient Variants of Public-Key Schemes for Smart Card Applications. 445-449
  
• Renato Menicocci:
  A Systematic Attack on Clock Controlled Cascades. 450-455
  
• Thomas Johansson, Ben J. M. Smeets:
  On A²-Codes Including Arbiter's Attacks. 456-460
  
• Eli Biham, Alex Biryukov:
  An Improvement of Davies' Attack on DES. 461-467
  
• Jaroslav Hruby:
  Q-Deformed Quantum Cryptography. 468-472