EUROCRYPT 1998: Espoo, Finland

Distributed Cryptography and Applications I

• Victor Shoup, Rosario Gennaro:
  Securing Threshold Cryptosystems against Chosen Ciphertext Attack. 1-16
  
• Adam Young, Moti Yung:
  Auto-Recoverable Auto-Certifiable Cryptosystems. 17-31
  
• Eiichiro Fujisaki, Tatsuaki Okamoto:
  A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. 32-46
  

Complexity Theory: Reductions and Lower Bounds

• Noboru Kunihiro, Kenji Koyama:
  Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Z_n and Factoring n. 47-58
  
• Dan Boneh, Ramarathnam Venkatesan:
  Breaking RSA May Not Be Equivalent to Factoring. 59-71
  
• Ueli M. Maurer, Stefan Wolf:
  Lower Bounds on Generic Algorithms in Groups. 72-84
  

Cryptanalysis of Block Ciphers

• Alex Biryukov, Eyal Kushilevitz:
  Improved Cryptanalysis of RC5. 85-99
  
• Eli Biham, Lars R. Knudsen:
  Cryptanalysis of the ANSI X9.52 CBCM Mode. 100-111
  
• Philip Hawkes:
  Differential-Linear Weak Key Classes of IDEA. 112-126
  

Distributed Cryptography and Applications II

• Matt Blaze, Gerrit Bleumer, Martin Strauss:
  Divertible Protocols and Atomic Proxy Cryptography. 127-144
  
• Kaoru Kurosawa, Yvo Desmedt:
  Optimum Traitor Tracing and Asymmetric Schemes. 145-157
  

Computational Algorithms

• Charanjit S. Jutla:
  On Finding Small Solutions of Modular Multivariate Polynomial Equations. 158-170
  
• Damian Weber:
  Computing Discrete Logarithms with Quadratic Number Rings. 171-183
  
• Jacques Patarin, Louis Goubin, Nicolas Courtois:
  Improved Algorithms for Isomorphisms of Polynomials. 184-200
  

Improving Computational Efficiency

• Adi Shamir:
  Visual Cryptanalysis. 201-210
  
• Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor:
  How to Improve an Exponentiation Black-Box. 211-220
  
• Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan:
  Speeding up Discrete Log and Factoring Based Schemes via Precomputations. 221-235
  
• Mihir Bellare, Juan A. Garay, Tal Rabin:
  Fast Batch Verification for Modular Exponentiation and Digital Signatures. 236-250
  

Paradigms for Symmetric Systems

• Matt Blaze, Joan Feigenbaum, Moni Naor:
  A Formal Treatment of Remotely Keyed Encryption. 251-265
  
• Mihir Bellare, Ted Krovetz, Phillip Rogaway:
  Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible. 266-280
  
• Mariusz H. Jakubowski, Ramarathnam Venkatesan:
  The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers. 281-293
  

Public Key Cryptosystems

• Detlef Hühnlein, Michael J. Jacobson Jr., Sachar Paulus, Tsuyoshi Takagi:
  A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption. 294-307
  
• Tatsuaki Okamoto, Shigenori Uchiyama:
  A New Public-Key Cryptosystem as Secure as Factoring. 308-318
  

Complexity Theory: One-Way Functions

• Alain P. Hiltgen:
  Towards a Better Understanding of One-Wayness: Facing Linear Permutations. 319-333
  
• Daniel R. Simon:
  Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? 334-345
  

Multi-Party Computation

• Matthew K. Franklin, Rebecca N. Wright:
  Secure Communications in Minimal Connectivity Models. 346-360
  
• Christian Cachin:
  On the Foundations of Oblivious Transfer. 361-374
  
• Donald Beaver, Avishai Wool:
  Quorum-Based Secure Multi-party Computation. 375-390
  

Digital Signatures

• David Pointcheval:
  Strengthened Security for Blind Signatures. 391-405
  
• Markus Michels, Markus Stadler:
  Generic Constructions for Secure and Efficient Confirmer Signature Schemes. 406-421
  
• Guillaume Poupard, Jacques Stern:
  Security Analysis of a Practical "on the fly" Authentication and Signature Generation. 422-436
  

Untraceability in Multi-party Schemes

• Masayuki Abe:
  Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers. 437-447
  
• Markus Jakobsson:
  A Practical Mix. 448-461
  

Boolean Functions

• Claude Carlet:
  On the Propagation Criterion of Degree l and Order k. 462-474
  
• Eric Filiol, Caroline Fontaine:
  Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity. 475-488
  
• William Millan, Andrew Clark, Ed Dawson:
  Heuristic Design of Cryptographically Strong Balanced Boolean Functions. 489-499
  

Combinatorial Design and Analysis of Distributed Schemes

• Carles Padró, Germán Sáez:
  Secret Sharing Schemes with Bipartite Access Structure. 500-511
  
• Michael Luby, Jessica Staddon:
  Combinatorial Bounds for Broadcast Encryption. 512-526
  
• Reihaneh Safavi-Naini, Huaxiong Wang:
  New Results on Multi-Receiver Authentication Codes. 527-541
  

Cryptoanalysis of Elliptic Curve Systems

• Don Coppersmith:
  Specialized Integer Factorization. 542-545
  
• Tatsuaki Okamoto, Shigenori Uchiyama:
  Security of an Identity-Based Cryptosystem and the Related Reductions. 546-560
  

Electronic Commerce and Payment

• Agnes Hui Chan, Yair Frankel, Yiannis Tsiounis:
  Easy Come - Easy Go Divisible Cash. 561-575
  
• Moni Naor, Benny Pinkas:
  Secure and Efficient Metering. 576-590
  
• N. Asokan, Victor Shoup, Michael Waidner:
  Optimistic Fair Exchange of Digital Signatures (Extended Abstract). 591-606