EUROCRYPT 1998

ESPOO, FINLAND

K. Nyberg (Ed.): Advances in Cryptology - EUROCRYPT 1998: International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May/June 1998. Proceedings. Lecture Notes in Computer Science, Vol. 1403, Springer, 1998, ISBN 3-540-64518-7

Read the paper abstracts. More »

Distributed Cryptography and Applications I

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

Complexity Theory: Reductions and Lower Bounds

• Noboru Kunihiro and Kenji Koyama: Equivalence of Counting the Number of Points on Elliptic Curve over the Ring ZZ n and Factoring n p. 47
• Dan Boneh and Ramarathnam Venkatesan: Breaking RSA May Not Be Equivalent to Factoring (Extended Abstract) p. 59
• Ueli M. Maurer and Stefan Wolf: Lower Bounds on Generic Algorithms in Groups p. 72

Cryptanalysis of Block Ciphers

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

Distributed Cryptography and Applications II

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

Computational Algorithms

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

Improving Computational Efficiency

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

Paradigms for Symmetric Systems

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

Public Key Cryptosystems

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

Complexity Theory: One-Way Functions

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

Multi-party Computation

• Matthew Franklin and Rebecca N. Wright: Secure Communication in Minimal Connectivity Models p. 346
• Christian Cachin: On the Foundations of Oblivious Transfer p. 361
• Donald Beaver and Avishai Wool: Quorum-Based Secure Multi-party Computation p. 375

Digital Signatures

• David Pointcheval: Strengthened Security for Blind Signatures p. 391
• Markus Michels and Markus Stadler: Generic Constructions for Secure and Efficient Confirmer Signature Schemes (Extended Abstract) p. 406
• Guillaume Poupard and Jacques Stern: Security Analysis of a Practical "on the fly" Authentication and Signature Generation p. 422

Untraceability in Multi-party Schemes

• Masayuki Abe: Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers p. 437
• Markus Jakobsson: A Practical Mix p. 448

Boolean Functions

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

Combinatorial Design and Analysis of Distributed Schemes

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

Cryptanalysis of Elliptic Curve Systems

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

Electronic Commerce and Payment

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