year |
venue |
title |
pages |
1989 | crypto | Digital signatures: The evolution of a fundamental primitive | |
1989 | crypto | Zero Knowledge Proofs of Knowledge in Two Rounds | 526-544 |
1989 | crypto | The FEAL-8 Cryptosystem and a Call for Attack | 624-627 |
1989 | crypto | UNIX Password Security - Ten Years Later | 44-63 |
1989 | crypto | Batch RSA | 175-185 |
1989 | crypto | Modular Exponentiation Using Recursive Sums of Residues | 371-386 |
1989 | crypto | A Fast Modular-multiplication Algorithm based on a Higher Radix | 387-399 |
1989 | crypto | Bit Commitment Using Pseudo-Randomness | 128-136 |
1989 | crypto | Covert Distributed Processing with Computer Viruses | 616-619 |
1989 | crypto | SDNS Architecture and End-to-End Encryption | 356-366 |
1989 | crypto | On Key Distribution Systems | 344-355 |
1989 | crypto | Properties of Cryptosystem PGM | 447-460 |
1989 | crypto | On the Linear Consistency Test (LCT) in Cryptanalysis with Applications | 164-174 |
1989 | crypto | On the Quadratic Spans of Periodic Sequences | 82-89 |
1989 | crypto | Addition Chain Heuristics | 400-407 |
1989 | crypto | On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses | 461-480 |
1989 | crypto | On the Concrete Complexity of Zero-Knowledge Proofs | 507-525 |
1989 | crypto | Sparse Pseudorandom Distributions | 113-127 |
1989 | crypto | Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks | 30-34 |
1989 | crypto | The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities | 591-602 |
1989 | crypto | Perfect Local Randomness in Pseudo-Random Sequences | 100-112 |
1989 | crypto | Undeniable Signatures | 212-216 |
1989 | crypto | Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash | 481-496 |
1989 | crypto | A Certified Digital Signature | 218-238 |
1989 | crypto | One Way Hash Functions and DES | 428-446 |
1989 | crypto | A Survey of Hardware Implementation of RSA (Abstract) | 368-370 |
1989 | crypto | Advances in Cryptology - CRYPTO '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings | online |
1989 | crypto | An Efficient Software Protection Scheme | 610-611 |
1989 | crypto | On the Classification of Idea Secret Sharing Schemes | 278-285 |
1989 | crypto | Flexible Access Control with Master Keys | 316-322 |
1989 | crypto | Secret Sharing Over Infinite Domains (Extended Abstract) | 299-306 |
1989 | crypto | Controlled Gradual Disclosure Schemes for Random Bits and Their Applications | 573-588 |
1989 | crypto | A Key Exchange System Based on Real Quadratic Fields | 335-343 |
1989 | crypto | A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang | 154-163 |
1989 | crypto | Minimum Resource Zero-Knowledge Proofs (Extended Abstract) | 545-546 |
1989 | crypto | Progress in Data Security Standardization | 620-623 |
1989 | crypto | On the Structure of Secret Key Exchange Protocols | 604-605 |
1989 | crypto | How Easy is Collision Search. New Results and Applications to DES | 408-413 |
1989 | crypto | How to Explain Zero-Knowledge Protocols to Your Children | 628-631 |
1989 | crypto | New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs | 194-211 |
1989 | crypto | Good S-Boxes Are Easy To Find | 612-615 |
1989 | crypto | The Shortest Feedback Shift Register That Can Generate A Given Sequence | 90-99 |
1989 | crypto | Non-Interactive Oblivious Transfer and Spplications | 547-557 |
1989 | crypto | On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs | 17-27 |
1989 | crypto | A Design Principle for Hash Functions | 416-427 |
1989 | crypto | Efficient Identification and Signatures for Smart Cards | 239-252 |
1989 | crypto | The use of Encryption in Kerberos for Network Authentication | 35-43 |
1989 | crypto | Keying the German Navy's Enigma | 2-5 |
1989 | crypto | An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract) | 606-609 |
1989 | crypto | Efficient Identification Schemes Using Two Prover Interactive Proofs | 498-506 |
1989 | crypto | On the Implementation of Elliptic Curve Cryptosystems | 186-192 |
1989 | crypto | How to Predict Congruential Generators | 138-153 |
1989 | crypto | Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context | 6-16 |
1989 | crypto | Threshold Cryptosystems | 307-315 |
1989 | crypto | Practical Problems with a Cryptographic Protection Scheme | 64-73 |
1989 | crypto | A Signature with Shared Verification Scheme | 253-262 |
1989 | crypto | The Smart Siskette - A Universal User Token and Personal Crypto-Engine | 74-79 |
1989 | crypto | Multiparty Protocols Tolerating Half Faulty Processors | 560-572 |
1989 | crypto | Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space | 286-298 |
1989 | crypto | Multiparty Computation with Faulty Majority | 589-590 |
1989 | crypto | On-Line/Off-Line Digital Schemes | 263-275 |
1989 | crypto | Key Distribution Protocol for Digital Mobile Communication Systems | 324-334 |
1989 | eurocrypt | A Single Chip 1024 Bits RSA Processor | 219-236 |
1989 | eurocrypt | Deciphering Bronze Age Scripts of Crete - The Case of Linear A | 649-650 |
1989 | eurocrypt | Cartesian Authentication Schemes | 476-490 |
1989 | eurocrypt | Counting Functions Satisfying a Higher Order Strict Avalanche Criterion | 63-74 |
1989 | eurocrypt | An Alternative to the Fiat-Shamir Protocol | 173-180 |
1989 | eurocrypt | A European Call For Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation | 267-271 |
1989 | eurocrypt | Unconditional Sender and Recipient Untraceability in Spite of Active Attacks | 302-319 |
1989 | eurocrypt | The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract) | 690 |
1989 | eurocrypt | A New Multiple Key Cipher and an Improved Voting Scheme | 617-625 |
1989 | eurocrypt | Full Secure Key Exchange and Authentication with no Previously Shared Secrets | 665-669 |
1989 | eurocrypt | Linear Complexity Profiles and Continued Fractions | 571-585 |
1989 | eurocrypt | On the Linear Complexity of Feedback Registers (Extended Abstract) | 563-570 |
1989 | eurocrypt | Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point | 523-532 |
1989 | eurocrypt | Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity | 636-647 |
1989 | eurocrypt | Cryptanalysis of a Modified Rotor Machine | 395-402 |
1989 | eurocrypt | Key Minimal Authentication Systems for Unconditional Secrecy | 497-501 |
1989 | eurocrypt | Cryptanalysis of Short RSA Secret Exponents (Abstract) | 372 |
1989 | eurocrypt | Random Mapping Statistics | 329-354 |
1989 | eurocrypt | Online Cash Checks | 288-293 |
1989 | eurocrypt | A Fats Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences | 586-595 |
1989 | eurocrypt | How to Improve Signature Schemes | 16-22 |
1989 | eurocrypt | Zero-Knowledge Proofs of Computational Power (Extended Summary) | online |
1989 | eurocrypt | Sorting out Zero-Knowledge | 181-191 |
1989 | eurocrypt | Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract) | 192-195 |
1989 | eurocrypt | Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract) | 412-422 |
1989 | eurocrypt | Efficient Offline Electronic Checks (Extended Abstract) | 294-301 |
1989 | eurocrypt | A Practical Protocol for Large Group Oriented Networks | 56-61 |
1989 | eurocrypt | Some Ideal Secret Sharing Schemes | 468-475 |
1989 | eurocrypt | A Cryptanalysis of Stepk, m-Cascades | 680-687 |
1989 | eurocrypt | Nonlinearity Criteria for Cryptographic Functions | 549-562 |
1989 | eurocrypt | On the Design of Permutation P in DES Type Cryptosystems | 696-705 |
1989 | eurocrypt | Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility | 134-148 |
1989 | eurocrypt | On the Complexity and Efficiency of a New Key Exchange System | 597-616 |
1989 | eurocrypt | An Information-Theoretic Treatment of Homophonic Substitution | 382-394 |
1989 | eurocrypt | Cryptel - The Practical Protection of an Existing Electronic Mail System | 237-242 |
1989 | eurocrypt | A General Zero-Knowledge Scheme (Extended Abstract) | 122-133 |
1989 | eurocrypt | An Identity-Based Key-Exchange Protocol | 29-37 |
1989 | eurocrypt | Parallel Generation of Recurring Sequences | 503-522 |
1989 | eurocrypt | How to Break the Direct RSA-Implementation of Mixes | 373-381 |
1989 | eurocrypt | Non-linearity of Exponent Permutations | 80-92 |
1989 | eurocrypt | More Efficient Match-Making and Satisfiability: The Five Card Trick | 208-217 |
1989 | eurocrypt | Verifiable Disclosure of Secrets and Applications (Abstract) | 150-154 |
1989 | eurocrypt | Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings | online |
1989 | eurocrypt | Detection of Disrupters in the DC Protocol | 320-327 |
1989 | eurocrypt | Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences | 691-695 |
1989 | eurocrypt | Zero-Knowledge Procedures for Confidential Access to Medical Records (Extended Summary) | 662-664 |
1989 | eurocrypt | Faster Primality Testing (Extended Abstract) | 652-656 |
1989 | eurocrypt | How Easy is Collision Search? Application to DES (Extended Summary) | 429-434 |
1989 | eurocrypt | 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms | 102-109 |
1989 | eurocrypt | Informational Divergence Bounds for Authentication Codes | 93-101 |
1989 | eurocrypt | Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies | 155-172 |
1989 | eurocrypt | Private-Key Algebraic-Code Cryptosystems with High Information Rates (Extended Abstract) | 657-661 |
1989 | eurocrypt | Feedforward Functions Defined By de Bruijn Sequences | 544-548 |
1989 | eurocrypt | Varying Feedback Shift Registers | 670-679 |
1989 | eurocrypt | The Use of Fractions in Public-Key Cryptosystems | 47-55 |
1989 | eurocrypt | A Fast Elliptic Curve Cryptosystem | 706-708 |
1989 | eurocrypt | A Key Distribution System Based On Any One-Way Function (Extended Abstract) | 75-79 |
1989 | eurocrypt | A Generalization of El Gamal's Public Key Cryptosystem | 23-28 |
1989 | eurocrypt | Cryptanalysis of Video Encryption Based on Space-Filling Curves | 403-411 |
1989 | eurocrypt | On the Security of Schnorr's Pseudo Random Generator | 423-428 |
1989 | eurocrypt | On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random | 533-543 |
1989 | eurocrypt | Legal Requirements Facing New Signature Technology | 273-287 |
1989 | eurocrypt | Efficient Identification and Signatures for Smart Cards (Abstract) | 688-689 |
1989 | eurocrypt | How to Say ``No'' | 491-496 |
1989 | eurocrypt | The Adolescence of Public-Key Cryptography (Abstract) | 2 |
1989 | eurocrypt | Technical Security: The Starting Point | 243-248 |
1989 | eurocrypt | Prepositioned Shared Secret and/or Shared Control Schemes | 436-467 |
1989 | eurocrypt | A Secure Public-key Authentication Scheme | 3-15 |
1989 | eurocrypt | A Simple Technique for Diffusing Cryptoperiods | 110-120 |
1989 | eurocrypt | How to Keep Authenticity Alive in a Computer Network | 38-46 |
1989 | eurocrypt | Atkin's Test: News From the Front | 626-635 |
1989 | eurocrypt | Security in Open Distributed Processing | 249-266 |
1989 | eurocrypt | Factoring by Electronic Mail | 355-371 |
1989 | jofc | Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits | 177-184 |
1989 | jofc | Hyperelliptic Cryptosystems | 139-150 |
1989 | jofc | A Study of Password Security | 151-158 |
1989 | jofc | Fast Correlation Attacks on Certain Stream Ciphers | 159-176 |
1989 | jofc | Linear Ciphers and Spreads | 185-188 |