Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications from Journal of Cryptology, 1998
Page
Title
1-27
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
29-43
A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems
45-58
Cryptanalysis of Multiple Modes of Operation
59-72
Attacks on Fast Double Block Length Hash Functions
75-86
On Matroid Characterization of Ideal Secret Sharing Schemes
87-108
Perfect Zero-Knowledge Arguments for
NP
Using Any One-Way Permutation
109-124
A Public-Key Cryptosystem Using Purely Cubic Fields
125-140
The Black-Box Model for Cryptographic Primitives
141-145
The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes - Okamoto - Vanstone Algorithm
147-159
Zero-Knowledge Authentication Scheme with Secret Key Exchange
161-185
Lattice Reduction: A Toolbox for the Cryptanalyst
187-208
An Efficient Existentially Unforgeable Signature Scheme and Its Applications
209-218
Two-Key Triple Encryption
219-234
Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
235-251
An Analysis of SAFER
253-271
Cryptanalysis of MD4
273-287
A Software-Optimized Encryption Algorithm