year |
venue |
title |
pages |
1992 | auscrypt | Cryptanalysis of LOKI91 | 196-208 |
1992 | auscrypt | HAVAL - A One-Way Hashing Algorithm with Variable Length of Output | 83-104 |
1992 | auscrypt | Prime Generation with the Demytko-Miller-Trbuvich Algorithm | 413-421 |
1992 | auscrypt | A Practical Digital Multisignature Scheme Based on Discrete Logarithms | 122-132 |
1992 | auscrypt | Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party | 133-142 |
1992 | auscrypt | Public-Key Cryptosystem Based on the Discrete Logarithm Problem | 469-476 |
1992 | auscrypt | Authentication Codes with Perfect Protection | 15-26 |
1992 | auscrypt | Nonasymptotic Estimates of Information Protection Efficiency for the Wire-tape Channel Concept (invited talk) | 185-195 |
1992 | auscrypt | Constructions of Freebly-One-Way Families of Permutations | 422-434 |
1992 | auscrypt | The Probability Distribution of the Diffie-Hellman Key | 492-504 |
1992 | auscrypt | Construction of m-ary de Bruijn Sequences (Extendet abstract) | 357-363 |
1992 | auscrypt | The Fast Cascade Exponentation Algorithm and its Applications on Cryptography | 447-456 |
1992 | auscrypt | A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers | 339-348 |
1992 | auscrypt | Secure Addition Sequence and Its Applications on the Server-Aided Secret Computation Protocols | 219-230 |
1992 | auscrypt | Modelling and Analyzing Cryprographic Protocols Using Petri Nets | 275-295 |
1992 | auscrypt | A Comparison of Key Distribution Patterns Constructed from Circle Geometries | 517-527 |
1992 | auscrypt | Nonperfect Secret Sharing Schemes | 56-66 |
1992 | auscrypt | Primality Testing with Lucas Functions | 539-542 |
1992 | auscrypt | Modified Maurer-Yacobi`s scheme and its applications | 308-323 |
1992 | auscrypt | New Protocols for Electronic Money | 263-274 |
1992 | auscrypt | Non-Interactive Generation of Shared Pseudorandom Sequences | 385-396 |
1992 | auscrypt | Remarks on "The Design of a Conference Key Distribution System" | 467-468 |
1992 | auscrypt | The Design of a Conference Key Distribution System | 459-466 |
1992 | auscrypt | Linear Nonequivalence versus Nonlinearity | 156-164 |
1992 | auscrypt | A Construction of Practical Secret Sharing Schemes using Linear Block Codes | 67-79 |
1992 | auscrypt | On Verifiable Implicit Asking Protocols for RSA Computation | 296-307 |
1992 | auscrypt | A Generalized Description of DES-based and Benes-based Permutationgenerators | 397-409 |
1992 | auscrypt | On the Power of Memory in the Design of Collision Resistant Hash Functions | 105-121 |
1992 | auscrypt | An Attack on Two Hash Functions by Zheng-Matsumoto-Imai | 535-538 |
1992 | auscrypt | An Approach to the Initial State Reconstruction of a Clock-Controlled Shift Register Based on a Novel Distance Measure | 349-356 |
1992 | auscrypt | A Block Cipher Method using Combinations of Different Methods under the Control of the User Key | 531-534 |
1992 | auscrypt | Advances in Cryptology - AUSCRYPT '92, Workshop on the Theory and Application of Cryptographic Techniques, Gold Coast, Queensland, Australia, December 13-16, 1992, Proceedings | |
1992 | auscrypt | Cryptanalysis of Summation Generator | 209-215 |
1992 | auscrypt | Treshold Cryptosystems (invited talk) | 3-14 |
1992 | auscrypt | Elliptic Curves over Fp Suitable for Cryptosystems | 479-491 |
1992 | auscrypt | Practical Proven Secure Authentication with Arbitration | 27-32 |
1992 | auscrypt | Constructing Large Cryptographically Strong S-boxes | 165-181 |
1992 | auscrypt | Authentication Codes under Impersonation Attack | 35-47 |
1992 | auscrypt | A Practical Secret Voting Scheme for Large Scale Elections | 244-251 |
1992 | auscrypt | Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes | 231-243 |
1992 | auscrypt | On Bit Correlations Among Preimages of "Many to One" One-Way Functions | 435-446 |
1992 | auscrypt | Cumulative Arrays and Geometric Secret Sharing Schemes | 48-55 |
1992 | auscrypt | Privacy for Multi-Party Protocols | 252-260 |
1992 | auscrypt | A Modular Exponentiation Unit Based on Systolic Arrays | 505-516 |
1992 | auscrypt | Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion | 145-155 |
1992 | auscrypt | Information Technology Security Standards - An Australian Perspective | 367-384 |
1992 | auscrypt | The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic | 327-338 |
1992 | crypto | Differential Cryptanalysis of the Full 16-Round DES | 487-496 |
1992 | crypto | Kid Krypto | 371-389 |
1992 | crypto | FFT-Hash-II is not yet Collision-free | 587-593 |
1992 | crypto | Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract) | 549-557 |
1992 | crypto | On the Information Rate of Secret Sharing Schemes (Extended Abstract) | 148-167 |
1992 | crypto | DES is not a Group | 512-520 |
1992 | crypto | Perfectly-Secure Key Distribution for Dynamic Conferences | 471-486 |
1992 | crypto | Content-Addressable Search Engines and DES-like Systems | 575-586 |
1992 | crypto | Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) | 196-214 |
1992 | crypto | Partially-Bent Functions | 280-291 |
1992 | crypto | Provably Unforgeable Signatures | 1-14 |
1992 | crypto | Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract) | 292-304 |
1992 | crypto | Provable Security Against Differential Cryptanalysis | 566-574 |
1992 | crypto | Protocols for Secret Key Agreement by Public Discussion Based on Common Information | 461-470 |
1992 | crypto | Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract) | 228-245 |
1992 | crypto | On Generation of Probable Primes By Incremental Search | 358-370 |
1992 | crypto | Designing and Detecting Trapdoors for Discrete Log Cryptosystems | 66-75 |
1992 | crypto | Massively Parallel Computation of Discrete Logarithms | 312-323 |
1992 | crypto | Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes | 31-53 |
1992 | crypto | An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn | 54-65 |
1992 | crypto | Efficient Multiplication on Certain Nonsupersingular Elliptic Curves | 333-344 |
1992 | crypto | Wallet Databases with Observers | 89-105 |
1992 | crypto | An l-Span Generalized Secret Sharing Scheme | 558-565 |
1992 | crypto | New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract) | 15-30 |
1992 | crypto | Pubic Randomness in Cryptography | 421-432 |
1992 | crypto | Making Electronic Refunds Safer | 106-112 |
1992 | crypto | Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings | online |
1992 | crypto | Threshold Schemes with Disenrollment | 540-548 |
1992 | crypto | A Quadratic Sieve on the n-Dimensional Cube | 324-332 |
1992 | crypto | On Defining Proofs of Knowledge | 390-420 |
1992 | crypto | Iterative Characteristics of DES and s²-DES | 497-511 |
1992 | crypto | Necessary and Sufficient Conditions For Collision-Free Hashing | 433-441 |
1992 | crypto | On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract) | 246-259 |
1992 | crypto | Certifying Cryptographic Tools: The Case of Trapdoor Permutations | 442-460 |
1992 | crypto | Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method | 345-357 |
1992 | crypto | On the Security of the Permuted Kernel Identification Scheme | 305-311 |
1992 | crypto | On the Design of SP Networks From an Information Theoretic Point of View | 260-279 |
1992 | crypto | Response to Comments on the NIST Proposed Digital Signature Standard | 76-88 |
1992 | crypto | Fair Public-Key Cryptosystems | 113-138 |
1992 | crypto | Low Communication 2-Prover Zero-Knowledge Proofs for NP | 215-227 |
1992 | crypto | Pricing via Processing or Combatting Junk Mail | 139-147 |
1992 | crypto | New General Lower Bounds on the Information Rate of Secret Sharing Schemes | 168-182 |
1992 | crypto | A High-Speed DES Implementation for Network Applications | 521-539 |
1992 | crypto | Universally Ideal Secret Sharing Schemes (Preliminary Version) | 183-195 |
1992 | eurocrypt | FFT-Hash II, Efficient Cryptographic Hashing | 45-54 |
1992 | eurocrypt | How to Break a "Secure" Oblivious Transfer Protocol | 285-296 |
1992 | eurocrypt | Cryptographic Protocols Provably Secure Against Dynamic Adversaries | 307-323 |
1992 | eurocrypt | A Montgomery-Suitable Fiat-Shamir-like Authenication Scheme | 488-491 |
1992 | eurocrypt | Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol? | 378-389 |
1992 | eurocrypt | A New Method for Known Plaintext Attack of FEAL Cipher | 81-91 |
1992 | eurocrypt | The One-Round Functions of the DES Generate the Alternating Group | 99-112 |
1992 | eurocrypt | Local Randomness in Candidate One-Way Functions | 408-419 |
1992 | eurocrypt | A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator | 239-255 |
1992 | eurocrypt | Factoring with an Oracle | 429-436 |
1992 | eurocrypt | On the Construction of Highly Nonlinear Permutations | 92-98 |
1992 | eurocrypt | Correlation via Linear Sequential Circuit Approximation of Combiners with memory | 113-123 |
1992 | eurocrypt | Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract) | 25-34 |
1992 | eurocrypt | A Remark on a Non-interactive Public-Key Distribution System | 458-460 |
1992 | eurocrypt | Transferred Cash Grows in Size | 390-407 |
1992 | eurocrypt | Suffix Tree and String Complexity | 138-152 |
1992 | eurocrypt | A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance | 472-476 |
1992 | eurocrypt | Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract) | 461-466 |
1992 | eurocrypt | Fast Exponentiation with Precomputation (Extended Abstract) | 200-207 |
1992 | eurocrypt | Secure Bit Commitment Function against Divertibility | 324-340 |
1992 | eurocrypt | How Intractable Is the Discrete Logarithm for a General Finite Group? | 420-428 |
1992 | eurocrypt | Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift register Sequence | 124-137 |
1992 | eurocrypt | How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function | 256-266 |
1992 | eurocrypt | Public-Key Cryptosystems with Very Small Key Length | 163-173 |
1992 | eurocrypt | Attacks on Protocols for Server-Aided RSA Computation | 153-162 |
1992 | eurocrypt | Graph Decompositions and Secret Sharing Schemes | 1-24 |
1992 | eurocrypt | Secure Audio Teleconferencing: A Practical Solution | 437-448 |
1992 | eurocrypt | A Note on Discrete Logorithms with Special Structure | 454-457 |
1992 | eurocrypt | How to Make Efficient Fail-stop Signatures | 366-377 |
1992 | eurocrypt | Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings | online |
1992 | eurocrypt | The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel) | 194-199 |
1992 | eurocrypt | Information-Theoretic Bounds for Authentication Frauds | 467-471 |
1992 | eurocrypt | Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications | 208-220 |
1992 | eurocrypt | Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing | 341-355 |
1992 | eurocrypt | High-Speed Implementation Methods for RSA Scheme | 221-238 |
1992 | eurocrypt | Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract) | 477-481 |
1992 | eurocrypt | On the Development of a Fast Elliptic Curve Cryptosystem | 482-487 |
1992 | eurocrypt | Differential Cryptanalysis Mod $2^32$ with Applications to MD5 | 71-80 |
1992 | eurocrypt | Secure Conference Key Distribution Schemes for Conspiracy Attack | 449-453 |
1992 | eurocrypt | A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function | 267-284 |
1992 | eurocrypt | Uniform Results in Polynomial-Time Security | 297-306 |
1992 | eurocrypt | Tools for Proving Zero Knowledge | 356-365 |
1992 | eurocrypt | Hash Function Based on Block Ciphers | 55-70 |
1992 | eurocrypt | Massively Parallel Elliptic Curve Factorin | 183-193 |
1992 | eurocrypt | FFT Hashing is not Collision-free | 35-44 |
1992 | eurocrypt | Resource Requirements for the Application of Addition Chains in Modulo Exponentiation | 174-182 |
1992 | jofc | Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures? | 41-52 |
1992 | jofc | Experimental Quantum Cryptography | 3-28 |
1992 | jofc | Some Remarks on the Security of the Identification Scheme Based on Permuted Kernels | 133-137 |
1992 | jofc | An Interactive Identification Scheme Based on Discrete Logarithms and Factoring | 29-39 |
1992 | jofc | Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes | 153-166 |
1992 | jofc | Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials | 193-207 |
1992 | jofc | Counting Binary Functions with Certain Cryptographic Properties | 107-131 |
1992 | jofc | A Cubic RSA Code Equivalent to Factorization | 139-150 |
1992 | jofc | Algebraic Properties of Cryptosystem PGM | 167-183 |
1992 | jofc | Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher | 53-66 |
1992 | jofc | A Universal Statistical Test for Random Bit Generators | 89-105 |
1992 | jofc | Correlation Properties of Combiners with Memory in Stream Ciphers | 67-86 |
1992 | jofc | Strongly Ideal Secret Sharing Schemes | 185-191 |