default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th CRYPTO 1998: Santa Barbara, California, USA
- Hugo Krawczyk:
Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings. Lecture Notes in Computer Science 1462, Springer 1998, ISBN 3-540-64892-5
Chosen-Ciphertext Security
- Daniel Bleichenbacher:
Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. 1-12 - Ronald Cramer, Victor Shoup:
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. 13-25 - Mihir Bellare, Anand Desai, David Pointcheval
, Phillip Rogaway:
Relations Among Notions of Security for Public-Key Encryption Schemes. 26-45
Invited Lecture
- Steven M. Bellovin:
Cryptography and the Internet. 46-55
Cryptanalysis of Hash Functions and Block Ciphers
- Florent Chabaud, Antoine Joux:
Differential Collisions in SHA-0. 56-71 - Alex Biryukov, Eyal Kushilevitz:
From Differential Cryptanalysis to Ciphertext-Only Attacks. 72-88
Distributed Cryptography
- Tal Rabin:
A Simplified Approach to Threshold and Proactive RSA. 89-104 - Dario Catalano, Rosario Gennaro:
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications. 105-120 - Matthias Fitzi, Martin Hirt, Ueli M. Maurer:
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). 121-136
Identification and Certification
- William Aiello, Sachin Lodha, Rafail Ostrovsky:
Fast Digital Identity Revocation (Extended Abstract). 137-152 - Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest:
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. 153-168 - Joe Kilian, Erez Petrank:
Identity Escrow. 169-185
Block Cipher Design and Analysis
- Charanjit S. Jutla:
Generalized Birthday Arracks on Unbalanced Feistel Networks. 186-199 - Takeshi Shimoyama, Toshinobu Kaneko:
Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES. 200-211 - Thomas Jakobson:
Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree. 212-222
Algebraic Crytanalysis
- Phong Q. Nguyen, Jacques Stern:
Cryptanalysis of the Ajtai-Dwork Cryptosystem. 223-242 - Serge Vaudenay:
Cryptanalysis of the Chor-Rivest Cryptosystem. 243-256 - Aviad Kipnis, Adi Shamir:
Cryptanalysis of the Oil & Vinegar Signature Scheme. 257-266
Relations Among Cryptographic Primitives
- Moni Naor, Omer Reingold:
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). 267-282 - Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan:
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. 283-298
IACR Distinguished Lecture
- Yonatan Aumann, Michael O. Rabin:
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). 299-303
Alebraic Schemes
- Sarvar Patel, Ganapathy S. Sundaram:
An Efficient Discrete Log Pseudo Random Generator. 304-317 - Tsuyoshi Takagi:
Fast RSA-Type Cryptosystem Modulo pkq. 318-326 - Neal Koblitz:
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm. 327-337
Quantum Cryptography
- Louis Salvail:
Quantum Bit Commitment from a Physical Assumption. 338-353
Signatures, Random Functions and Ideal Ciphers
- Kazuo Ohta, Tatsuaki Okamoto:
On Concrete Security Treatment of Signatures Derived from Identification. 354-369 - Chris Hall, David A. Wagner, John Kelsey, Bruce Schneier:
Building PRFs from PRPs. 370-389 - William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan:
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers. 390-407
Zero-Knowledge
- Satoshi Hada, Toshiaki Tanaka:
On the Existence of 3-Round Zero-Knowledge Protocols. 408-423 - Ronald Cramer, Ivan Damgård:
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? 424-441 - Cynthia Dwork, Amit Sahai:
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. 442-457
Implementation
- Damian Weber, Thomas F. Denny:
The Solution of McCurley's Discrete Log Challenge. 458-471 - Daniel V. Bailey, Christof Paar:
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. 472-485
Rights Protection
- Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Willemson:
Time-Stamping with Binary Linking Schemes. 486-501 - Moni Naor, Benny Pinkas:
Threshold Traitor Tracing. 502-517
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-15 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
