year |
venue |
title |
pages |
1990 | asiacrypt | Advances in Cryptology - AUSCRYPT '90, International Conference on Cryptology, Sydney, Australia, January 8-11, 1990, Proceedings | |
1990 | auscrypt | Record Encryption in Distributed Databases | 386-395 |
1990 | auscrypt | RSA as a Benchmark for Multiprocessor Machines | 356-359 |
1990 | auscrypt | Direct Demonstration of the Power to Break Public-Key Cryptosystems | 14-21 |
1990 | auscrypt | Anonymous One-Time Signatures and Flexible Untraceable Electronic Cash | 294-305 |
1990 | auscrypt | Network Security Policy Models | 74-95 |
1990 | auscrypt | K-M Sequence is Forwardly Predictable | 37-38 |
1990 | auscrypt | Dyadic Matrices and Their Potential Significance in Cryptography | 308-310 |
1990 | auscrypt | Solving Equations in Sequences | 327-332 |
1990 | auscrypt | Large Primes in Stream Cipher Cryptography | 194-205 |
1990 | auscrypt | LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications | 229-236 |
1990 | auscrypt | Range Equations and Range Matrices: a Study in Statistical Database Security | 360-385 |
1990 | auscrypt | Key Scheduling In Des Type Cryptosystems | 221-228 |
1990 | auscrypt | Secure Cryptographic Initialisation | 451-462 |
1990 | auscrypt | Some Remarks on Authentication Systems | 122-139 |
1990 | auscrypt | Secure User Access Control for Public Networks | 46-57 |
1990 | auscrypt | A Note on Strong Fibonacci Pseudoprimes | 311-317 |
1990 | auscrypt | Meet-in-the-Middle Attack on Digital Signature Schemes | 140-154 |
1990 | auscrypt | The Three Faces of Information Security | 433-450 |
1990 | auscrypt | KEYMEX: An expert system for the design of key management schemes | 96-103 |
1990 | auscrypt | Minòs: Extended User Authentication | 410-423 |
1990 | auscrypt | Showing Credentials without Identification Transfeering Signatures between Unconditionally Unlinkable Pseudonyms | 246-264 |
1990 | auscrypt | Permutation Generators of Alternating Groups | 237-244 |
1990 | auscrypt | The Implementation of Elliptic Curve Cryptosystems | 2-13 |
1990 | auscrypt | A Fast Iterative Algorithm For A Shift Register Initial State Reconstruction Given The Nosiy Output Sequence | 165-175 |
1990 | auscrypt | Continued Fractions and the Berlekamp-Massey Algorithm | 24-31 |
1990 | auscrypt | Universal Logic Sequences | 426-432 |
1990 | auscrypt | Lower Bounds on the Weight Complexities of Cascaded Binary Sequences | 39-43 |
1990 | auscrypt | Parallel Generation of Pseudo-Random Sequences | 176-193 |
1990 | auscrypt | The Practical Application Of State Of The Art Security In Real Environments | 334-355 |
1990 | auscrypt | A Fast Modular-multiplication Module for Smart Cards | 406-409 |
1990 | auscrypt | On The Formal Analysis of PKCS Authentication Protocols | 106-121 |
1990 | auscrypt | VLSI Design for Exponentiation in GF (2n) | 398-405 |
1990 | auscrypt | A Binary Sequence Generator Based on Ziv-Lempel Source Coding | 156-164 |
1990 | auscrypt | On the Significance of the Directed Acyclic Word Graph in Cryptology | 318-326 |
1990 | auscrypt | A (non-practical) three-pass identification protocol using coding theory | 265-272 |
1990 | auscrypt | Demonstrating Possession without Revealing Factors and its Application | 273-293 |
1990 | auscrypt | Nonlinear Generators of Binary Sequences with Controllable Complexity and Double Key | 32-36 |
1990 | auscrypt | Comparison of Block Ciphers | 208-220 |
1990 | auscrypt | Formal Specification and Verification of Secure Communication Protocols | 58-73 |
1990 | crypto | Publicly Verifiable Non-Interactive Zero-Knowledge Proofs | 353-365 |
1990 | crypto | (title unknown) | |
1990 | crypto | Differential Cryptanalysis of DES-like Cryptosystems | 2-21 |
1990 | crypto | The FEAL Cipher Family | 627-638 |
1990 | crypto | CORSAIR: A SMART Card for Public Key Cryptosystems | 502-513 |
1990 | crypto | A Modular Approach to Key Distribution | 274-283 |
1990 | crypto | A Key Distribution "Paradox" | 268-273 |
1990 | crypto | Discrete-Log With Compressible Exponents | 639-643 |
1990 | crypto | A Statistical Attack of the FEAL-8 Cryptosystem | 22-33 |
1990 | crypto | An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications | 34-47 |
1990 | crypto | Structural Properties of One-way Hash Functions | 285-302 |
1990 | crypto | Convertible Undeniable Signatures | 189-205 |
1990 | crypto | A Universal Statistical Test for Random Bit Generators | 409-420 |
1990 | crypto | Fair Computation of General Functions in Presence of Immoral Majority | 77-93 |
1990 | crypto | Quantum Bit Commitment and Coin Tossing Protocols | 49-61 |
1990 | crypto | How to Time-Stamp a Digital Document | 437-455 |
1990 | crypto | On the Impossibility of Private Key Cryptography with Weakly Random Keys | 421-435 |
1990 | crypto | One-Way Group Actions | 94-107 |
1990 | crypto | How to Utilize the Randomness of Zero-Knowledge Proofs | 456-475 |
1990 | crypto | Unconditionally Secure Digital Signatures | 206-214 |
1990 | crypto | Fast Software Encryption Functions | 476-501 |
1990 | crypto | A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms | 576-581 |
1990 | crypto | Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings | online |
1990 | crypto | Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes | 242-252 |
1990 | crypto | Achieving Zero-Knowledge Robustly | 313-325 |
1990 | crypto | Matrix Extensions of the RSA Algorithm | 140-155 |
1990 | crypto | On the Computation of Discrete Logarithms in Class Groups | 134-139 |
1990 | crypto | Interactive Proofs with Provable Security Against Honest Verifiers | 378-392 |
1990 | crypto | Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S | 530-544 |
1990 | crypto | A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion | 564-574 |
1990 | crypto | The MD4 Message Digest Algorithm | 303-311 |
1990 | crypto | Finding Four Million Large Random Primes | 625-626 |
1990 | crypto | Constructing Elliptic Curve Cryptosystems in Characteristic 2 | 156-167 |
1990 | crypto | The REDOC II Cryptosystem | 545-563 |
1990 | crypto | Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems | 366-377 |
1990 | crypto | Adi Shamir: On the Universality of the Next Bit Test | 394-408 |
1990 | crypto | Fast Checkers for Cryptography | 515-529 |
1990 | crypto | Nonlinear Parity Circuits and their Cryptographic Applications | 582-600 |
1990 | crypto | Geometric Shared Secret and/or Shared Control Schemes | 216-241 |
1990 | crypto | Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract) | 177-188 |
1990 | crypto | Multi-Language Zero Knowledge Interactive Proof Systems | 339-352 |
1990 | crypto | Solving Large Sparse Linear Systems over Finite Fields | 109-133 |
1990 | crypto | Cryptographic Significance of the Carry for Ciphers Based on Integer Addition | 601-614 |
1990 | crypto | Collective Coin Tossing Without Assumptions nor Broadcasting | 253-266 |
1990 | crypto | Computation of Discrete Logarithms in Prime Fields (Extended Abstract) | 616-618 |
1990 | crypto | Identification Tokens - or: Solving the Chess Grandmaster Problem | 169-177 |
1990 | crypto | Security with Low Communication Overhead | 62-76 |
1990 | crypto | Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract) | 326-338 |
1990 | crypto | Systolic Modular Multiplication | 619-624 |
1990 | eurocrypt | Software Run-Time Protection: A Cryptographic Issue | 474-480 |
1990 | eurocrypt | A Cryptographic Library for the Motorola DSP56000 | 230-244 |
1990 | eurocrypt | On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2 | 306-312 |
1990 | eurocrypt | Properties of Binary Functions | online |
1990 | eurocrypt | Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers | 313-317 |
1990 | eurocrypt | A Remark on a Signature Scheme Where Forgery Can Be Proved | 441-445 |
1990 | eurocrypt | Which New RSA Signatures Can Be Computed From Some Given RSA Signatures? | 83-97 |
1990 | eurocrypt | An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number | 481-486 |
1990 | eurocrypt | Correlation Functions of Geometric Sequences | 214-221 |
1990 | eurocrypt | The Linear Complexity Profile and the Jump Complexity of Keystream Sequences | 174-188 |
1990 | eurocrypt | A Provably-Secure Strongly-Randomized Cipher | 361-373 |
1990 | eurocrypt | Constructions of Bent Functions and Difference Sets | 151-160 |
1990 | eurocrypt | A New Trapdoor in Knapsacks | 405-411 |
1990 | eurocrypt | Exponentiating Faster with Addition Chains | 222-229 |
1990 | eurocrypt | Zero-Knowledge Undeniable Signatures | 458-464 |
1990 | eurocrypt | A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparion Approach | 487-491 |
1990 | eurocrypt | An Interactive Identification Scheme Based on Discrete Logarithms and Factoring | 63-71 |
1990 | eurocrypt | Correlation Properties of Combiners with Memory in Stream Ciphers | 204-213 |
1990 | eurocrypt | Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme | 446-457 |
1990 | eurocrypt | On an Implementation of the Mohan-Adiga Algorithm | 496-500 |
1990 | eurocrypt | Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions | 1-10 |
1990 | eurocrypt | Fast Signature Generation With a Fiat Shamir-Like Scheme | 432-440 |
1990 | eurocrypt | A Remark on the Efficiency of Identification Schemes | 493-495 |
1990 | eurocrypt | A Known Plaintext Attack on Two-Key Triple Encryption | 318-325 |
1990 | eurocrypt | Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 "Digital Signature Scheme Giving Message Recovery" | 465-473 |
1990 | eurocrypt | VICTOR an Efficient RSA Hardware Implementation | 245-252 |
1990 | eurocrypt | The MD4 Message Digest Algorithm (Abstract) | 492 |
1990 | eurocrypt | How to Construct Pseudorandom Permutations from Single Pseudorandom Functions | 140-150 |
1990 | eurocrypt | Oblivous Transfer Protecting Secrecy | 31-45 |
1990 | eurocrypt | Advances in Cryptology - EUROCRYPT '90, Workshop on the Theory and Application of of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990, Proceedings | online |
1990 | eurocrypt | Propagation Characteristics of Boolean Functions | 161-173 |
1990 | eurocrypt | Lower Bounds for Authentication Codes With Splitting | 283-293 |
1990 | eurocrypt | Cryptosystem for Group Oriented Cryptography | 352-360 |
1990 | eurocrypt | Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields | 98-109 |
1990 | eurocrypt | Lower Bounds for the Linear Complexity of Sequences over Residue Rings | 189-195 |
1990 | eurocrypt | Experimental Quantum Cryptography | 253-265 |
1990 | eurocrypt | A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party | 266-282 |
1990 | eurocrypt | Provably Secure Key-Updating Schemes in Identity-Based Systems | 16-30 |
1990 | eurocrypt | On the Importance of Memory Resources in the Security of Key Exchange Protocols | 11-15 |
1990 | eurocrypt | On the Construction of Run Permuted Sequences | 196-203 |
1990 | eurocrypt | General Public Key Residue Cryptosystems and Mental Poker Protocols | 374-388 |
1990 | eurocrypt | Essentially l-Fold Secure Authentication Systems | 294-305 |
1990 | eurocrypt | A Proposal for a New Block Encryption Standard | 389-404 |
1990 | eurocrypt | Confirmation that Some Hash Functions Are Not Collision Free | 326-343 |
1990 | eurocrypt | Public-Randomness in Public Key Cryptography | 46-62 |
1990 | eurocrypt | On the Design of Provably Secure Cryptographic Hash Functions | 412-431 |
1990 | eurocrypt | Inverting the Pseudo Exponentiation | 344-351 |
1990 | eurocrypt | Distributed Primality Proving and the Primality of (23539+1)/3 | 110-123 |
1990 | eurocrypt | Factoring With Two Large Primes | 72-82 |
1990 | jofc | Methods and Instruments for Designing S-Boxes | 115-130 |
1990 | jofc | Key-Minimal Crytosystems for Unconditional Secrecy | 1-25 |
1990 | jofc | A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs | 63-76 |
1990 | jofc | A Matrix Key-Distribution Scheme | 51-59 |
1990 | jofc | A Fast Software One-Way Hash Function | 43-58 |
1990 | jofc | Enumerating Boolean Functions of Cryptographic Significance | 155-170 |
1990 | jofc | The Cryptanalysis of FEAL-4 with 20 Chosen Plaintexts | 145-154 |
1990 | jofc | Probability To Meet in the Middle | 13-22 |
1990 | jofc | Information-Theoretic Bounds for Authentication Schemes | 131-143 |
1990 | jofc | A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences | 105-112 |
1990 | jofc | Secure Circuit Evaluation | 1-12 |
1990 | jofc | The Structured Design of Cryptographically Good S-Boxes | 27-41 |
1990 | jofc | A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration | 77-104 |
1990 | jofc | The Combinatorics of Authentication and Secrecy Codes | 23-49 |