year |
venue |
title |
pages |
1999 | asiacrypt | An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks | 348-362 |
1999 | asiacrypt | Elliptic Scalar Multiplication Using Point Halving | 135-149 |
1999 | asiacrypt | ECC: Do We Need to Count? | 122-134 |
1999 | asiacrypt | Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings | online |
1999 | asiacrypt | Modulus Search for Elliptic Curve Cryptosystems | 1-7 |
1999 | asiacrypt | On the Lai-Massey Scheme | 8-19 |
1999 | asiacrypt | Equivalent Keys of HPC | 29-42 |
1999 | asiacrypt | Linear Complexity versus Pseudorandomness: On Beth and Dai's Result | 288-298 |
1999 | asiacrypt | A3-Codes under Collusion Attacks | 390-398 |
1999 | asiacrypt | Mix-Networks on Permutation Networks | 258-273 |
1999 | asiacrypt | Cryptanalysis of Two Cryptosystems Based on Group Actions | 52-61 |
1999 | asiacrypt | A Class of Explicit Perfect Multi-sequences | 299-305 |
1999 | asiacrypt | Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields | 219-231 |
1999 | asiacrypt | A Signature Scheme with Message Recovery as Secure as Discrete Logarithm | 378-389 |
1999 | asiacrypt | Doing More with Fewer Bits | 321-332 |
1999 | asiacrypt | How to Prove That a Committed Number Is Prime | 208-218 |
1999 | asiacrypt | Secure Communication in an Unknown Network Using Certificates | 274-287 |
1999 | asiacrypt | A Quick Group Key Distribution Scheme with "Entity Revocation" | 333-347 |
1999 | asiacrypt | Periodical Multi-secret Threshold Cryptosystems | 363-377 |
1999 | asiacrypt | Factorization of RSA-140 Using the Number Field Sieve | 195-207 |
1999 | asiacrypt | Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries | 165-179 |
1999 | asiacrypt | Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function | 306-320 |
1999 | asiacrypt | Approximation Hardness and Secure Communication in Broadcast Channels | 247-257 |
1999 | asiacrypt | Speeding up the Discrete Log Computation on Curves with Automorphisms | 103-121 |
1999 | asiacrypt | General Adversaries in Unconditional Multi-party Computation | 232-246 |
1999 | asiacrypt | Broadcast Authentication in Group Communication | 399-411 |
1999 | asiacrypt | Adaptively-Secure Optimal-Resilience Proactive RSA | 180-194 |
1999 | asiacrypt | Probabilistic Higher Order Differential Attack and Higher Order Bent Functions | 62-74 |
1999 | asiacrypt | On Cryptographically Secure Vectorial Boolean Functions | 20-28 |
1999 | asiacrypt | Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials | 43-51 |
1999 | asiacrypt | Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves | 86-102 |
1999 | asiacrypt | Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field | 75-85 |
1999 | asiacrypt | On the Design of RSA with Short Secret Exponent | 150-164 |
1999 | ches | Factoring Large Numbers with the Twinkle Device (Extended Abstract) | 2-12 |
1999 | ches | Fast Multiplication in Finite Fields GF(2N) | 122-134 |
1999 | ches | We Need Assurance | 1 |
1999 | ches | A High-Performance Flexible Architecture for Cryptography | 231-245 |
1999 | ches | A Scalable Architecture for Montgomery Multiplication | 94-108 |
1999 | ches | Montgomery's Multiplication Technique: How to Make It Smaller and Faster | 80-93 |
1999 | ches | A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond | 37-48 |
1999 | ches | Cryptographic Hardware and Embedded Systems, First International Workshop, CHES'99, Worcester, MA, USA, August 12-13, 1999, Proceedings | online |
1999 | ches | Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation | 316-327 |
1999 | ches | Random Number Generators Founded on Signal and Information Theory | 219-230 |
1999 | ches | Elliptic Curve Scalar Multiplier Design Using FPGAs | 257-268 |
1999 | ches | A Design of Reliable True Random Number Generator for Cryptographic Applications | 204-218 |
1999 | ches | DES Cracking on the Transmogrifier 2a | 13-24 |
1999 | ches | Probing Attacks on Tamper-Resistant Devices | 303-315 |
1999 | ches | NICE - New Ideal Coset Encryption | 328-339 |
1999 | ches | Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton | 49-60 |
1999 | ches | Highly Regular Architectures for Finite Field Computation Using Redundant Basis | 269-279 |
1999 | ches | Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis | 280-291 |
1999 | ches | Arithmetic Design for Permutation Groups | 109-121 |
1999 | ches | Modelling the Crypto-Processor from Design to Synthesis | 25-36 |
1999 | ches | Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201 | 61-72 |
1999 | ches | Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems | 292-302 |
1999 | ches | Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks | 340-352 |
1999 | ches | Efficient Finite Field Basis Conversion Involving Dual Bases | 135-143 |
1999 | ches | Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems | 187-203 |
1999 | ches | IPA: A New Class of Power Attacks | 173-186 |
1999 | ches | How to Implement Cost-Effective and Secure Public Key Cryptosystems | 73-79 |
1999 | ches | DES and Differential Power Analysis (The "Duplication" Method) | 158-172 |
1999 | ches | Power Analysis Attacks of Modular Exponentiation in Smartcards | 144-157 |
1999 | ches | CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor | 246-256 |
1999 | crypto | The All-or-Nothing Nature of Two-Party Secure Computation | 80-97 |
1999 | crypto | Dynamic Traitor Training | 354-371 |
1999 | crypto | The Evolution of Public-Key Cryptography | |
1999 | crypto | Secure Integration of Asymmetric and Symmetric Encryption Schemes | 537-554 |
1999 | crypto | Adaptive Security for Threshold Cryptosystems | 98-115 |
1999 | crypto | Efficient Methods for Integrating Traceability and Broadcast Encryption | 372-387 |
1999 | crypto | Factoring N = prq for Large r | 326-337 |
1999 | crypto | Abuse-Free Optimistic Contract Signing | 449-466 |
1999 | crypto | Oblivious Transfer with Adaptive Queries | 573-590 |
1999 | crypto | An Efficient Public Key Traitor Tracing Scheme | 338-353 |
1999 | crypto | Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97 | 288-304 |
1999 | crypto | Two Party RSA Key Generation | 116-129 |
1999 | crypto | Compressing Cryptographic Resources | 591-608 |
1999 | crypto | Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality | 198-215 |
1999 | crypto | The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications | 31-46 |
1999 | crypto | Separability and Efficiency for Generic Group Signature Schemes | 413-430 |
1999 | crypto | Towards Sound Approaches to Counteract Power-Analysis Attacks | 398-412 |
1999 | crypto | Cryptanalysis of ``2 R'' Schemes | 315-325 |
1999 | crypto | On the Security Properties of OAEP as an All-or-Nothing Transform | 503-518 |
1999 | crypto | Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK | 467-484 |
1999 | crypto | Information-Theoretic Cryptography | 47-64 |
1999 | crypto | UMAC: Fast and Secure Message Authentication | 216-233 |
1999 | crypto | Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings | online |
1999 | crypto | An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes | 624-638 |
1999 | crypto | Weakness in Quaternion Signatures | 305-314 |
1999 | crypto | Robust Distributed Multiplicaton with out Interaction | 130-147 |
1999 | crypto | Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization | 19-30 |
1999 | crypto | On the Security of RSA Padding | 1-18 |
1999 | crypto | Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier | 270-287 |
1999 | crypto | Truncated Differentials and Skipjack | 165-180 |
1999 | crypto | On Concurrent Zero-Knowledge with Pre-processing | 485-502 |
1999 | crypto | Fast Correlation Attacks Based on Turbo Code Techniques | 181-197 |
1999 | crypto | Auditable, Anonymous Electronic Cash Extended Abstract | 555-572 |
1999 | crypto | A Forward-Secure Digital Signature Scheme | 431-448 |
1999 | crypto | Differential Power Analysis | 388-397 |
1999 | crypto | A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic | 148-164 |
1999 | crypto | Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions | 252-269 |
1999 | crypto | Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization | 519-536 |
1999 | crypto | Information Theoretically Secure Communication in the Limited Storage Space Model | 65-79 |
1999 | crypto | Coding Constructions for Blacklisting Problems without Computational Assumptions | 609-623 |
1999 | crypto | SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions | 234-251 |
1999 | eprint | Signature Schemes Based on the Strong RSA Assumption | online |
1999 | eprint | Chinese Remaindering with Errors | online |
1999 | eprint | An error in the mixed adversary protocol by Fitzi, Hirt and Maurer | online |
1999 | eprint | Public-key cryptography and password protocols | online |
1999 | eprint | Lattice Based Cryptography: A Global Improvement | online |
1999 | eprint | Fast Proof of Plaintext-Knowledge and Deniable Authentication Based on Chinese Remainder Theorem | online |
1999 | eprint | DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem | online |
1999 | eprint | Verifiable Encryption and Applications to Group Signatures and Signature Sharing | online |
1999 | eprint | On the Existence of 3-Round Zero-Knowledge Protocols | online |
1999 | eprint | A Relationship between One-Wayness and Correlation Intractability | online |
1999 | eprint | Practical Threshold Signatures | online |
1999 | eprint | On Formal Models for Secure Key Exchange | online |
1999 | eprint | Secure Hash-and-Sign Signatures without the Random Oracle | online |
1999 | eprint | Concurrent Zero-Knowledge is Easy in Practice | online |
1999 | eprint | A forward-secure digital signature scheme | online |
1999 | eprint | A Composition Theorem for Universal One-Way Hash Functions | online |
1999 | eprint | Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization | online |
1999 | eprint | Improving the Exact Security of Digital Signature Schemes | online |
1999 | eprint | Public-Key Cryptography and Password Protocols: The Multi-User Case | online |
1999 | eprint | Resettable Zero-Knowledge | online |
1999 | eprint | Concurrent Zero-Knowledge | online |
1999 | eprint | A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion | online |
1999 | eurocrypt | Secure Hash-and-Sign Signatures Without the Random Oracle | 123-139 |
1999 | eurocrypt | On the Performance of Hyperelliptic Cryptosystems | 165-175 |
1999 | eurocrypt | Secure Distributed Key Generation for Discrete-Log Based Cryptosystems | 295-310 |
1999 | eurocrypt | A Note on the Limits of Collusion-Resistant Watermarks | 140-149 |
1999 | eurocrypt | Distributed Pseudo-random Functions and KDCs | 327-346 |
1999 | eurocrypt | Resistance Against General Iterated Attacks | 255-271 |
1999 | eurocrypt | Software Performance of Universal Hash Functions | 24-41 |
1999 | eurocrypt | Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question | 446-458 |
1999 | eurocrypt | Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications | 432-445 |
1999 | eurocrypt | An Analysis of Exponentiation Based on Formal Languages | 375-388 |
1999 | eurocrypt | S-boxes with Controllable Nonlinearity | 286-294 |
1999 | eurocrypt | Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes | 347-362 |
1999 | eurocrypt | Public-Key Cryptosystems Based on Composite Degree Residuosity Classes | 223-238 |
1999 | eurocrypt | Computationally Private Information Retrieval with Polylogarithmic Communication | 402-414 |
1999 | eurocrypt | Comparing the MOV and FR Reductions in Elliptic Curve Cryptography | 190-205 |
1999 | eurocrypt | Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes | 107-122 |
1999 | eurocrypt | Coin-Based Anonymous Fingerprinting | 150-164 |
1999 | eurocrypt | Efficient Multiparty Computations Secure Against an Adaptive Adversary | 311-326 |
1999 | eurocrypt | XOR and Non-XOR Differential Probabilities | 272-285 |
1999 | eurocrypt | An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack | 90-106 |
1999 | eurocrypt | New Public Key Cryptosystems Based on the Dependent-RSA Problems | 239-254 |
1999 | eurocrypt | Efficient Communication-Storage Tradeoffs for Multicast Encryption | 459-474 |
1999 | eurocrypt | Cryptanalysis of RSA with Private Key d Less than N0.292 | 1-11 |
1999 | eurocrypt | Advances in Cryptology - EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding | online |
1999 | eurocrypt | Unbalanced Oil and Vinegar Signature Schemes | 206-222 |
1999 | eurocrypt | Conditional Oblivious Transfer and Timed-Release Encryption | 74-89 |
1999 | eurocrypt | On the Concurrent Composition of Zero-Knowledge Proofs | 415-431 |
1999 | eurocrypt | Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem | 363-374 |
1999 | eurocrypt | On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions | 56-73 |
1999 | eurocrypt | Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic | 176-189 |
1999 | eurocrypt | Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key | 389-401 |
1999 | eurocrypt | Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials | 12-23 |
1999 | eurocrypt | Lower Bounds for Oblivious Transfer Reductions | 42-55 |
1999 | fse | On the Security of Double and 2-Key Triple Modes of Operation | 215-230 |
1999 | fse | Scramble All, Encrypt Small | 95-111 |
1999 | fse | Mod n Cryptanalysis, with Applications Against RC5P and M6 | 139-155 |
1999 | fse | On the Decorrelated Fast Cipher (DFC) and Its Theory | 81-94 |
1999 | fse | On Security of the 128-Bit Block Cipher DEAL | 60-70 |
1999 | fse | Accelerated Remotely Keyed Encruption | 112-123 |
1999 | fse | Cryptanalysis of a Reduced Version of the Block Cipher E2 | 71-80 |
1999 | fse | Interpolation Attacks of the Block Cipher: SNAKE | 275-289 |
1999 | fse | Towards Making Luby-Rackoff Ciphers Optimal and Practical | 171-185 |
1999 | fse | Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers | 201-214 |
1999 | fse | A Revised Version of Crypton - Crypton V1.0 | 31-45 |
1999 | fse | The Boomerang Attack | 156-170 |
1999 | fse | High-Speed Pseudorandom Number Generation with Small Memory | 290-304 |
1999 | fse | Improved Analysis of Some Simplified Variants of RC6 | 1-15 |
1999 | fse | Attack on Six Rounds of Crypton | 46-59 |
1999 | fse | On the Security of CS-Cipher | 260-274 |
1999 | fse | Fast Software Encryption, 6th International Workshop, FSE '99, Rome, Italy, March 24-26, 1999, Proceedings | online |
1999 | fse | On the Construction of Variable-Input-Length Ciphers | 231-244 |
1999 | fse | Miss in the Middle Attacks on IDEA and Khufu | 124-138 |
1999 | fse | Slide Attacks | 245-259 |
1999 | fse | SOBER Crytanalysis | 305-316 |
1999 | fse | Linear Cryptanalysis of RC5 and RC6 | 16-30 |
1999 | fse | A New Characterization of Almost Bent Functions | 186-200 |
1999 | jofc | Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer | 117-139 |
1999 | jofc | How to Stretch Random Functions: The Security of Protected Counter Sums | 185-192 |
1999 | jofc | Cryptanalysis of Triple Modes of Operation | 161-184 |
1999 | jofc | On a Fallacious Bound for Authentication Codes | 155-159 |
1999 | jofc | On the Contrast in Visual Cryptography Schemes | 261-289 |
1999 | jofc | Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages | 197-223 |
1999 | jofc | Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver | 77-89 |
1999 | jofc | Chinese Remaindering Based Cryptosystems in the Presence of Faults | 241-245 |
1999 | jofc | On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited | 29-66 |
1999 | jofc | Parallel Collision Search with Cryptanalytic Applications | 1-28 |
1999 | jofc | Bounds for Key Distribution Patterns | 227-239 |
1999 | jofc | Bucket Hashing and Its Application to Fast Message Authentication | 91-115 |
1999 | jofc | On the Security of a Practical Identification Scheme | 247-260 |
1999 | jofc | Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic | 141-151 |
1999 | jofc | The Discrete Logarithm Problem on Elliptic Curves of Trace One | 193-196 |
1999 | jofc | A Fast Diffie-Hellman Protocol in Genus 2 | 67-73 |
1999 | pkc | How to Enhance the Security of Public-Key Encryption at Minimum Cost | 53-68 |
1999 | pkc | A New type of ``Magic Ink'' Signatures - Towards Transcript-Irrelevant Anonymity Revocation | 1-11 |
1999 | pkc | Encrypted Message Authentication by Firewalls | 69-81 |
1999 | pkc | A New Aspect of Dual Basis for Efficient Field Arithmetic | 12-28 |
1999 | pkc | Unknown Key-Share Attacks on the Station-to-Station (STS) Protocol | 154-170 |
1999 | pkc | On the Security of Random Sources | 29-42 |
1999 | pkc | A Relationship between One-Wayness and Correlation Intractability | 82-96 |
1999 | pkc | Decision Oracles are Equivalent to Matching Oracles | 276-289 |
1999 | pkc | On Quorum Controlled Asymmetric Proxy Re-encryption | 112-121 |
1999 | pkc | Mini-Cash: A Minimalistic Approach to E-Commerce | 122-135 |
1999 | pkc | On the Security of RSA Screening | 197-203 |
1999 | pkc | The Effectiveness of Lattice Attacks Against Low-Exponent RSA | 204-218 |
1999 | pkc | Message Recovery Fair Blind Signature | 97-111 |
1999 | pkc | Toward Fair International Key Escrow | 171-187 |
1999 | pkc | How to Copyright a Function? | 188-196 |
1999 | pkc | Preserving Privacy in Distributed Delegation with Fast Certificates | 136-153 |
1999 | pkc | A Trapdoor Permutation Equivalent to Factoring | 219-222 |
1999 | pkc | Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor | 223-234 |
1999 | pkc | Evaluating Differential Fault Analysis of Unknown Cryptosystems | 235-244 |
1999 | pkc | Removing Interoperability Barriers Between the X.509 and EDIFACT Public Key Infrastructures: The DEDICA Project | 245-262 |
1999 | pkc | Hash Functions and the MAC Using All-or-Nothing Property | 263-275 |
1999 | pkc | Shared Generation of Random Number with Timestamp: How to Cope with the Leakage of the CA's Secret | 290-305 |
1999 | pkc | Public Key Cryptography, Second International Workshop on Practice and Theory in Public Key Cryptography, PKC '99, Kamakura, Japan, March 1-3, 1999, Proceedings | online |
1999 | pkc | Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy | 306-314 |
1999 | pkc | A Secure Pay-per View Scheme for Web-Based Video Service | 315-326 |
1999 | pkc | Anonymous Fingerprinting Based on Committed Oblivious Transfer | 43-52 |