CRYPTO 1998

SANTA BARBARA, CALIFORNIA

H. Krawczyk (Ed.): Advances in Cryptology - CRYPTO'98: 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 1998. Proceedings. Lecture Notes in Computer Science, Vol, 1462, Springer, 1998, ISBN: 3-540-64892-5

Read the paper abstracts. More »

Chosen-Ciphertext Security

• Daniel Bleichenbacher: Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 p. 1
• Ronald Cramer, Victor Shoup: A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack p. 13
• Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway: Relations Among Notions of Security for Public-Key Encryption Schemes p. 26

Invited Lecture

• Steven M. Bellovin: Cryptography and the Internet p. 46

Cryptanalysis of Hash Functions and Block Ciphers

• Florent Chabaud, Antoine Joux: Differential Collisions in SHA-0 p. 56
• Alex Biryukov, Eyal Kushilevitz: From Differential Cryptanalysis to Ciphertext-Only Attacks p. 72

Distributed Cryptography

• Tal Rabin: A Simplified Approach to Threshold and Proactive RSA p. 89
• Dario Catalano, Rosario Gennaro: New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications p. 105
• Matthias Fitzi, Martin Hirt, Ueli Maurer: Trading Correctness for Privacy in Unconditional Multi-party Computation p. 121

Identification and Certification

• William Aiello, Sachin Lodha, Rafail Ostrovsky: Fast Digital Identity Revocation p. 137
• Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest: Self-Delegation with Controlled Propagation – or – What If You Lose Your Laptop p. 153
• Joe Kilian, Erez Petrank: Identity Escrow p. 169

Block Cipher Design and Analysis

• Charanjit S. Jutla: Generalized Birthday Attacks on Unbalanced Feistel Networks p. 186
• Takeshi Shimoyama, Toshinobu Kaneko: Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES p. 200
• Thomas Jakobsen: Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree p. 212

Algebraic Cryptanalysis

• Phong Nguyen, Jacques Stern: Cryptanalysis of the Ajtai-Dwork Cryptosystem p. 223
• Serge Vaudenay: Cryptanalysis of the Chor-Rivest Cryptosystem p. 243
• Aviad Kipnis, Adi Shamir: Cryptanalysis of the Oil & Vinegar Signature Schemep. 257

Relations Among Cryptographic Primitives

• Moni Naor, Omer Reingold: From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs p. 267
• Mihir Bellare, Shai Halevi, Amit Sahai, Salil Vadhan: Many-to-One Trapdoor Functions and their Relation to Public-Key Cryptosystems p. 283

IACR Distinguished Lecture

• Yonatan Aumann, Michael O. Rabin: Authentication, Enhanced Security and Error Correcting Codes p. 299

Algebraic Schemes

• Sarvar Patel, Ganapathy S. Sundaram: An Efficient Discrete Log Pseudo Random Generator p. 304
• Tsuyoshi Takagi: Fast RSA-type Cryptosystem Modulo pkq p. 318
• Neal Koblitz: An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithmp. 327

Quantum Cryptography

• Louis Salvail: Quantum Bit Commitment from a Physical Assumption p. 338

Signatures, Random Functions and Ideal Ciphers

• Kazuo Ohta, Tatsuaki Okamoto: On Concrete Security Treatment of Signatures Derived from Identification p. 354
• Chris Hall, David Wagner, John Kelsey, Bruce Schneier: Building PRFs from PRPs p. 370
• William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan: Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers p. 390

Zero-Knowledge

• Satoshi Hada, Toshiaki Tanaka: On the Existence of 3-Round Zero-Knowledge Protocols p. 408
• Ronald Cramer, Ivan Damg°ard: Zero-Knowledge Proofs for Finite Field Arithmetic, or: Can Zero-Knowledge Be for Free? p. 424
• Cynthia Dwork, Amit Sahai: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints p. 442

Implementation

• Damian Weber, Thomas Denny: The Solution of McCurley’s Discrete Log Challenge p. 458
• Daniel V. Bailey, Christof Paar: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms p. 472

Rights Protection

• Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson: Time-Stamping with Binary Linking Schemes p. 486
• Moni Naor, Benny Pinkas: Threshold Traitor Tracing p. 502