International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings

Page	Title
1-12	Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1
13-25	A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
26-45	Relations Among Notions of Security for Public-Key Encryption Schemes
46-55	Cryptography and the Internet
56-71	Differential Collisions in SHA-0
72-88	From Differential Cryptoanalysis to Ciphertext-Only Attacks
89-104	A Simplified Approach to Threshold and Proactive RSA
105-120	New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
121-136	Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)
137-152	Fast Digital Identity Revocation (Extended Abstract)
153-168	Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop
169-185	Identity Escrow
186-199	Generalized Birthday Arracks on Unbalanced Feistel Networks
200-211	Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES
212-222	Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree
223-242	Cryptanalysis of the Ajtai-Dwork Cryptosystem
243-256	Cryptanalysis of the Chor-Rivest Cryptosystem
257-266	Cryptanalysis of the Oil & Vinegar Signature Scheme
267-282	From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)
283-298	Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems
299-303	Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)
304-317	An Efficient Discrete Log Pseudo Random Generator
318-326	Fast RSA-Type Cryptosystem Modulo p^kq
327-337	An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm
338-353	Quantum Bit Commitment from a Physical Assumption
354-369	On Concrete Security Treatment of Signatures Derived from Identification
370-389	Building PRFs from PRPs
390-407	Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers
408-423	On the Existence of 3-Round Zero-Knowledge Protocols
424-441	Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
442-457	Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints
458-471	The Solution of McCurley's Discrete Log Challenge
472-485	Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
486-501	Time-Stamping with Binary Linking Schemes
502-517	Threshold Traitor Tracing