year |
venue |
title |
pages |
1998 | asiacrypt | Efficient Elliptic Curve Exponentiation Using Mixed Coordinates | 51-65 |
1998 | asiacrypt | Analysis Methods for (Alleged) RC4 | 327-341 |
1998 | asiacrypt | Advances in Cryptology - ASIACRYPT '98, International Conference on the Theory and Applications of Cryptology and Information Security, Beijing, China, October 18-22, 1998, Proceedings | online |
1998 | asiacrypt | Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement | 405-419 |
1998 | asiacrypt | Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers | 126-132 |
1998 | asiacrypt | Improved Truncated Differential Attacks on SAFER | 133-147 |
1998 | asiacrypt | Some Bounds and a Construction for Secure Broadcast Encryption | 420-433 |
1998 | asiacrypt | The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure | 372-379 |
1998 | asiacrypt | Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) | 380-391 |
1998 | asiacrypt | A Group Signature Scheme with Improved Efficiency | 160-174 |
1998 | asiacrypt | Cryptanalysis of the Original McEliece Cryptosystem | 187-199 |
1998 | asiacrypt | Generating RSA Moduli with a Predetermined Portion | 1-10 |
1998 | asiacrypt | Improving the Security of the McEliece Public-Key Cryptosystem | 200-213 |
1998 | asiacrypt | A Study on the Proposed Korean Digital Signature Algorithm | 175-186 |
1998 | asiacrypt | Adaptively Secure Oblivious Transfer | 300-314 |
1998 | asiacrypt | C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai | 35-49 |
1998 | asiacrypt | Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings | 95-109 |
1998 | asiacrypt | Cryptoanalysis in Prime Order Subgroups of Z*n | 214-226 |
1998 | asiacrypt | Efficient Fair Exchange with Verifiable Confirmation of Signatures | 286-299 |
1998 | asiacrypt | An Attack on RSA Given a Small Fraction of the Private Key Bits | 25-34 |
1998 | asiacrypt | Optimal Resistance Against the Davies and Murphy Attack | 148-159 |
1998 | asiacrypt | Generation of Shared RSA Keys by Two Parties | 11-24 |
1998 | asiacrypt | Off-Line Fair Payment Protocols Using Convertible Signatures | 271-285 |
1998 | asiacrypt | ML-Sequences over Rings Z/(2e)*: I. Constructions of Nondegenerative ML-Sequences II. Injectiveness of Compression Mappings of New Classes | 315-326 |
1998 | asiacrypt | Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC | 227-241 |
1998 | asiacrypt | Audio and Optical Cryptography | 392-404 |
1998 | asiacrypt | Bounds and Constructions for Multireceiver Authentication Codes | 242-256 |
1998 | asiacrypt | Fair Off-Line e-cash Made Easy | 257-270 |
1998 | asiacrypt | Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n | 80-94 |
1998 | asiacrypt | Efficient Implementation of Schoof's Algorithm | 66-79 |
1998 | asiacrypt | Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators | 342-356 |
1998 | asiacrypt | ECC/DLP and Factoring-Based Cryptography: A Tale of Two Families | 50 |
1998 | asiacrypt | Elliptic Curve Discrete Logarithms and the Index Calculus | 110-125 |
1998 | asiacrypt | A New Efficient All-Or-Nothing Disclosure of Secrets Protocol | 357-371 |
1998 | crypto | Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1 | 1-12 |
1998 | crypto | Cryptanalysis of the Chor-Rivest Cryptosystem | 243-256 |
1998 | crypto | Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract) | 121-136 |
1998 | crypto | The Solution of McCurley's Discrete Log Challenge | 458-471 |
1998 | crypto | Threshold Traitor Tracing | 502-517 |
1998 | crypto | From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract) | 267-282 |
1998 | crypto | New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications | 105-120 |
1998 | crypto | Differential Collisions in SHA-0 | 56-71 |
1998 | crypto | Cryptanalysis of the Ajtai-Dwork Cryptosystem | 223-242 |
1998 | crypto | Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop | 153-168 |
1998 | crypto | On Concrete Security Treatment of Signatures Derived from Identification | 354-369 |
1998 | crypto | On the Existence of 3-Round Zero-Knowledge Protocols | 408-423 |
1998 | crypto | Building PRFs from PRPs | 370-389 |
1998 | crypto | From Differential Cryptoanalysis to Ciphertext-Only Attacks | 72-88 |
1998 | crypto | An Efficient Discrete Log Pseudo Random Generator | 304-317 |
1998 | crypto | Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings | online |
1998 | crypto | Time-Stamping with Binary Linking Schemes | 486-501 |
1998 | crypto | Identity Escrow | 169-185 |
1998 | crypto | A Simplified Approach to Threshold and Proactive RSA | 89-104 |
1998 | crypto | Cryptanalysis of the Oil & Vinegar Signature Scheme | 257-266 |
1998 | crypto | Relations Among Notions of Security for Public-Key Encryption Schemes | 26-45 |
1998 | crypto | Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? | 424-441 |
1998 | crypto | Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree | 212-222 |
1998 | crypto | A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack | 13-25 |
1998 | crypto | Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems | 283-298 |
1998 | crypto | Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers | 390-407 |
1998 | crypto | Quantum Bit Commitment from a Physical Assumption | 338-353 |
1998 | crypto | Fast Digital Identity Revocation (Extended Abstract) | 137-152 |
1998 | crypto | An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm | 327-337 |
1998 | crypto | Generalized Birthday Arracks on Unbalanced Feistel Networks | 186-199 |
1998 | crypto | Cryptography and the Internet | 46-55 |
1998 | crypto | Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract) | 299-303 |
1998 | crypto | Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES | 200-211 |
1998 | crypto | Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms | 472-485 |
1998 | crypto | Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints | 442-457 |
1998 | crypto | Fast RSA-Type Cryptosystem Modulo pkq | 318-326 |
1998 | eprint | On Protocol Divertibility | online |
1998 | eprint | The Graph Clustering Problem has a Perfect Zero-Knowledge Proof | online |
1998 | eprint | Private Information Retrieval by Keywords | online |
1998 | eprint | Universal Service Providers for Database Private Information Retrieval | online |
1998 | eprint | On the possibility of basing Cryptography on the assumption that $P \neq NP$ | online |
1998 | eprint | A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack | online |
1998 | eprint | Fast Batch Verification for Modular Exponentiation and Digital Signatures | online |
1998 | eprint | An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products | online |
1998 | eprint | A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols | online |
1998 | eprint | Chameleon Hashing and Signatures | online |
1998 | eprint | The Random Oracle Methodology, Revisited | online |
1998 | eprint | Maintaining Authenticated Communication in the Presence of Break-ins | online |
1998 | eprint | A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication) | online |
1998 | eprint | Randomness versus Fault-Tolerance | online |
1998 | eprint | More on Proofs of Knowledge | online |
1998 | eprint | Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment) | online |
1998 | eprint | Security and Composition of Multi-party Cryptographic Protocols | online |
1998 | eprint | Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems | online |
1998 | eprint | Almost All Discrete Log Bits Are Simultaneously Secure | online |
1998 | eprint | Relations among Notions of Security for Public-Key Encryption Schemes | online |
1998 | eprint | Insecurity of Quantum Computations | online |
1998 | eprint | Security amplification by composition: The case of doubly-iterated, ideal ciphers | online |
1998 | eprint | The Disparity between Work and Entropy in Cryptology | online |
1998 | eprint | Secure Distributed Storage and Retrieval | online |
1998 | eprint | Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK | online |
1998 | eurocrypt | Secure Communications in Minimal Connectivity Models | 346-360 |
1998 | eurocrypt | Cryptanalysis of the ANSI X9.52 CBCM Mode | 100-111 |
1998 | eurocrypt | Quorum-Based Secure Multi-party Computation | 375-390 |
1998 | eurocrypt | Improved Cryptanalysis of RC5 | 85-99 |
1998 | eurocrypt | Fast Batch Verification for Modular Exponentiation and Digital Signatures | 236-250 |
1998 | eurocrypt | Divertible Protocols and Atomic Proxy Cryptography | 127-144 |
1998 | eurocrypt | Combinatorial Bounds for Broadcast Encryption | 512-526 |
1998 | eurocrypt | A Formal Treatment of Remotely Keyed Encryption | 251-265 |
1998 | eurocrypt | Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible | 266-280 |
1998 | eurocrypt | Secure and Efficient Metering | 576-590 |
1998 | eurocrypt | Easy Come - Easy Go Divisible Cash | 561-575 |
1998 | eurocrypt | Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity | 475-488 |
1998 | eurocrypt | Computing Discrete Logarithms with Quadratic Number Rings | 171-183 |
1998 | eurocrypt | Speeding up Discrete Log and Factoring Based Schemes via Precomputations | 221-235 |
1998 | eurocrypt | Auto-Recoverable Auto-Certifiable Cryptosystems | 17-31 |
1998 | eurocrypt | Lower Bounds on Generic Algorithms in Groups | 72-84 |
1998 | eurocrypt | A New Public-Key Cryptosystem as Secure as Factoring | 308-318 |
1998 | eurocrypt | Security of an Identity-Based Cryptosystem and the Related Reductions | 546-560 |
1998 | eurocrypt | How to Improve an Exponentiation Black-Box | 211-220 |
1998 | eurocrypt | Generic Constructions for Secure and Efficient Confirmer Signature Schemes | 406-421 |
1998 | eurocrypt | Secret Sharing Schemes with Bipartite Access Structure | 500-511 |
1998 | eurocrypt | On the Foundations of Oblivious Transfer | 361-374 |
1998 | eurocrypt | Specialized Integer Factorization | 542-545 |
1998 | eurocrypt | The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers | 281-293 |
1998 | eurocrypt | Improved Algorithms for Isomorphisms of Polynomials | 184-200 |
1998 | eurocrypt | On Finding Small Solutions of Modular Multivariate Polynomial Equations | 158-170 |
1998 | eurocrypt | Differential-Linear Weak Key Classes of IDEA | 112-126 |
1998 | eurocrypt | Strengthened Security for Blind Signatures | 391-405 |
1998 | eurocrypt | Towards a Better Understanding of One-Wayness: Facing Linear Permutations | 319-333 |
1998 | eurocrypt | Security Analysis of a Practical "on the fly" Authentication and Signature Generation | 422-436 |
1998 | eurocrypt | Breaking RSA May Not Be Equivalent to Factoring | 59-71 |
1998 | eurocrypt | On the Propagation Criterion of Degree l and Order k | 462-474 |
1998 | eurocrypt | Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding | online |
1998 | eurocrypt | Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers | 437-447 |
1998 | eurocrypt | A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption | 294-307 |
1998 | eurocrypt | Visual Cryptanalysis | 201-210 |
1998 | eurocrypt | Securing Threshold Cryptosystems against Chosen Ciphertext Attack | 1-16 |
1998 | eurocrypt | A Practical Mix | 448-461 |
1998 | eurocrypt | Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Zn and Factoring n | 47-58 |
1998 | eurocrypt | Optimum Traitor Tracing and Asymmetric Schemes | 145-157 |
1998 | eurocrypt | Optimistic Fair Exchange of Digital Signatures (Extended Abstract) | 591-606 |
1998 | eurocrypt | A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications | 32-46 |
1998 | eurocrypt | New Results on Multi-Receiver Authentication Codes | 527-541 |
1998 | eurocrypt | Heuristic Design of Cryptographically Strong Balanced Boolean Functions | 489-499 |
1998 | eurocrypt | Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? | 334-345 |
1998 | fse | Cryptanalytic Attacks on Pseudorandom Number Generators | 168-188 |
1998 | fse | On the Design and Security of RC2 | 206-221 |
1998 | fse | Attacking Triple Encryption | 239-253 |
1998 | fse | Higher Order Differential Attak of CAST Cipher | 17-31 |
1998 | fse | About Feistel Schemes with Six (or More) Rounds | 103-121 |
1998 | fse | Fast Software Encryption, 5th International Workshop, FSE '98, Paris, France, March 23-25, 1998, Proceedings | online |
1998 | fse | Cryptanalysis of Some Recently-Proposed Multiple Modes of Operation | 254-269 |
1998 | fse | Differential Cryptanalysis of KHF | 293-296 |
1998 | fse | Differential Cryptanalysis of the ICE Encryption Algorithm | 270-283 |
1998 | fse | MRD Hashing | 134-149 |
1998 | fse | On the Security of the Hashing Scheme Based on SL2 | 93-102 |
1998 | fse | Joint Hardware / Software Design of a Fast Stream Cipher | 75-92 |
1998 | fse | New Constructions for Secure Hash Functions | 150-167 |
1998 | fse | New Results in Linear Cryptanalysis of RC5 | 1-16 |
1998 | fse | Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs | 122-133 |
1998 | fse | Cryptanalysis of TWOPRIME | 32-48 |
1998 | fse | Fast Hashing and Stream Encryption with PANAMA | 60-74 |
1998 | fse | CS-Cipher | 189-205 |
1998 | fse | Serpent: A New Block Cipher Proposal | 222-238 |
1998 | fse | The First Two Rounds of MD4 are Not One-Way | 284-292 |
1998 | fse | JEROBOAM | 49-59 |
1998 | jofc | Cryptanalysis of Multiple Modes of Operation | 45-58 |
1998 | jofc | Zero-Knowledge Authentication Scheme with Secret Key Exchange | 147-159 |
1998 | jofc | On Matroid Characterization of Ideal Secret Sharing Schemes | 75-86 |
1998 | jofc | Two-Key Triple Encryption | 209-218 |
1998 | jofc | Lattice Reduction: A Toolbox for the Cryptanalyst | 161-185 |
1998 | jofc | An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions | 1-27 |
1998 | jofc | Attacks on Fast Double Block Length Hash Functions | 59-72 |
1998 | jofc | Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two | 219-234 |
1998 | jofc | An Analysis of SAFER | 235-251 |
1998 | jofc | Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation | 87-108 |
1998 | jofc | A Software-Optimized Encryption Algorithm | 273-287 |
1998 | jofc | A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems | 29-43 |
1998 | jofc | A Public-Key Cryptosystem Using Purely Cubic Fields | 109-124 |
1998 | jofc | The Black-Box Model for Cryptographic Primitives | 125-140 |
1998 | jofc | Cryptanalysis of MD4 | 253-271 |
1998 | jofc | The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes - Okamoto - Vanstone Algorithm | 141-145 |
1998 | jofc | An Efficient Existentially Unforgeable Signature Scheme and Its Applications | 187-208 |
1998 | pkc | Distributed Public Key Cryptosystems | 1-13 |
1998 | pkc | A Signcryption Scheme with Signature Directly Verifiable by Public Key | 55-59 |
1998 | pkc | Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders | 60-71 |
1998 | pkc | A Practical Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-bit Microcomputer | 182-194 |
1998 | pkc | An Authenticated Diffie-Hellman Key Agreement Protocol Secure Against Active Attacks | 135-148 |
1998 | pkc | A Scheme for Obtaining a Message from the Digital Multisignature | 154-163 |
1998 | pkc | Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm | 253-257 |
1998 | pkc | Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map | 195-202 |
1998 | pkc | Certifying Trust | 83-98 |
1998 | pkc | A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme | 258-262 |
1998 | pkc | On the Security of Server-Aided RSA Protocols | 99-116 |
1998 | pkc | A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation | 217-233 |
1998 | pkc | How (not) to Design RSA Signature Schemes | 14-28 |
1998 | pkc | Lower Bounds on Term-Based Divisible Cash Systems | 72-82 |
1998 | pkc | On the Security of Girault`s Identification Scheme | 149-153 |
1998 | pkc | Secure Hyperelliptic Cryptosystems and Their Performances | 164-181 |
1998 | pkc | A New Hash Function Based on MDx-Family and Its Application to MAC | 234-246 |
1998 | pkc | Lattices and Cryptography: An Overview | 50-54 |
1998 | pkc | On the Security of ElGamal Based Encryption | 117-134 |
1998 | pkc | Public-Key Cryptosystems Using the Modular Group | 203-216 |
1998 | pkc | Public Key Cryptography, First International Workshop on Practice and Theory in Public Key Cryptography, PKC '98, Pacifico Yokohama, Japan, February 5-6, 1998, Proceedings | online |
1998 | pkc | Security Issues for Contactless Smart Cards | 247-252 |
1998 | pkc | Overview of Elliptic Curve Cryptography | 29-49 |